Skip to main content
Log in

Data clustering using K-Means based on Crow Search Algorithm

  • Published:
Sādhanā Aims and scope Submit manuscript

Abstract

Cluster analysis is one of the popular data mining techniques and it is defined as the process of grouping similar data. K-Means is one of the clustering algorithms to cluster the numerical data. The features of K-Means clustering algorithm are easy to implement and it is efficient to handle large amounts of data. The major problem with K-Means is the selection of initial centroids. It selects the initial centroids randomly and it leads to a local optimum solution. Recently, nature-inspired optimization algorithms are combined with clustering algorithms to obtain the global optimum solution. Crow Search Algorithm (CSA) is a new population-based metaheuristic optimization algorithm. This algorithm is based on the intelligent behaviour of the crows. In this paper, CSA is combined with the K-Means clustering algorithm to obtain the global optimum solution. Experiments are conducted on benchmark datasets and the results are compared to those from various clustering algorithms and optimization-based clustering algorithms. Also the results are evaluated with internal, external and statistical experiments to prove the efficiency of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13

Similar content being viewed by others

References

  1. Han J, Pei J and Kamber M 2011 Data mining: concepts and techniques. Elsevier, United States

    MATH  Google Scholar 

  2. Yang X S 2008 Introduction to computational mathematics. World Scientific, Singapore

    Book  Google Scholar 

  3. Holland J H 1975 Adaption in natural and artificial systems. Ann Arbor, MI: The University of Michigan Press

    MATH  Google Scholar 

  4. Goldberg D 1989 Genetic algorithms in search, optimization and machine learning. Addison-Wesley, United States

    MATH  Google Scholar 

  5. Dorigo M 1992 Optimization, learning and natural algorithms. PhD Thesis, Politecnico di Milano

  6. Brooks S P and Morgan B J 1995 Optimization using simulated annealing. The Statistician 44(2): 241–257

    Article  Google Scholar 

  7. Eberhart R and Kennedy J 1995 A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, MHS’95, pp. 39–43, IEEE

  8. Kennedy J and Eberhart R 1995 Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, Perth, WA, vol. 4, pp. 1942–1948

  9. Glover F and Laguna M 1997 Tabu search. Boston: Kluwer

    Book  Google Scholar 

  10. Holland J H 1975 Adaptation in natural and artificial systems: an introductory analysis with application to biology, control, and artificial intelligence. Ann Arbor, MI: University of Michigan Press, pp. 439–444

  11. Chu S C, Tsai P W and Pan J S 2006 Cat swarm optimization. In: Proceedings of the Pacific Rim International Conference on Artificial Intelligence. Berlin–Heidelberg: Springer, pp. 854–858

  12. Basturk B and Karaboga D 2006 An artificial bee colony (ABC) algorithm for numeric function optimization. In: Proceedings of the IEEE Swarm Intelligence Symposium, Indianapolis, Indiana, USA

  13. Karaboga D and Basturk B 2007 A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39(3): 459–471

    Article  MathSciNet  Google Scholar 

  14. Karaboga D and Basturk B 2007 Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: Proceedings of the International Fuzzy Systems Association World Congress. Berlin–Heidelberg: Springer, pp. 789–798

  15. Yang X S and Deb S 2009 Cuckoo search via Levy flights. In: Proceedings of the World Congress on Nature and Biologically Inspired Computing, NaBIC 2009, IEEE, pp. 210–214

  16. Yang X S and Deb S 2014 Cuckoo search: recent advances and applications. Neural Computing and Applications 24(1): 169–174

    Article  Google Scholar 

  17. Rashedi E, Nezamabadi-Pour H and Saryazdi S 2009 GSA: a gravitational search algorithm. Information Sciences 179(13): 2232–2248

    Article  Google Scholar 

  18. Yang X S 2010 Firefly algorithm, Levy flights and global optimization. In: Proceedings of Research and Development in Intelligent Systems XXVI. London: Springer, pp. 209–218

    Google Scholar 

  19. Yang X S 2010 A new metaheuristic bat-inspired algorithm. In: Proceedings of Nature Inspired Cooperative Strategies for Optimization, NICSO 2010. Berlin–Heidelberg: Springer, pp. 65–74

    Chapter  Google Scholar 

  20. Tang R, Fong S, Yang X S and Deb S 2012 Wolf search algorithm with ephemeral memory. In: Proceedings of the Seventh International Conference on Digital Information Management (ICDIM), IEEE, pp. 165–172

  21. Gandomi A H and Alavi A H 2012 Krill herd: a new bio-inspired optimization algorithm. Communications in Nonlinear Science and Numerical Simulation 17(12): 4831–4845

    Article  MathSciNet  Google Scholar 

  22. Askarzadeh A 2016 A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Computers and Structures 169: 1–12

    Article  Google Scholar 

  23. Shelokar P S, Jayaraman V K and Kulkarni B D 2004 An ant colony approach for clustering. Analytica Chimica Acta 509(2): 187–195

    Article  Google Scholar 

  24. Selim S Z and Alsultan K 1991 A simulated annealing (SA) algorithm for the clustering problem. Pattern Recognition 24(10): 1003–1008

    Article  MathSciNet  Google Scholar 

  25. Chen C Y and Ye F 2004 Particle swarm optimization algorithm and its application to clustering analysis. In: Proceedings of the IEEE International Conference on Networking, Sensing and Control, IEEE, vol. 2, pp. 789–794

    Google Scholar 

  26. Al-Sultan K S 1995 A tabu search approach to the clustering problem. Pattern Recognition 28(9): pp.1443–1451

    Article  Google Scholar 

  27. Zhang C, Ouyang D and Ning J 2010 An artificial bee colony approach for clustering. Expert Systems with Applications 37(7): 4761–4767

    Article  Google Scholar 

  28. Karaboga D and Ozturk C 2011 A novel clustering approach: Artificial Bee Colony (ABC) algorithm. Applied Soft Computing 11(1): 652–657

    Article  Google Scholar 

  29. Santosa B and Ningrum M K 2009 Cat swarm optimization for clustering. In: Proceedings of the International Conference on Soft Computing and Pattern Recognition, SOCPAR’09, IEEE, pp. 54–59

  30. Krishna K and Murty M N 1999 Genetic K-means algorithm. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 29(3): 433–439

    Article  Google Scholar 

  31. Lu J and Hu R 2013 A new hybrid clustering algorithm based on K-means and ant colony algorithm. In: Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)

  32. Sun LX, Xu F, Liang Y Z, Xie Y L and Yu R Q 1994 Cluster analysis by the K-means algorithm and simulated annealing. Chemometrics and Intelligent Laboratory Systems 25(1): 51–60

    Article  Google Scholar 

  33. Van der Merwe D W and Engelbrecht A P 2003 Data clustering using particle swarm optimization. In: Proceedings of the 2003 Congress on Evolutionary Computation, CEC’03, IEEE, vol. 1, pp. 215–220

  34. Ahmadyfard A and Modares H 2008 Combining PSO and k-means to enhance data clustering. In: Proceedings of the International Symposium on Telecommunications, IEEE, pp. 688–691

  35. Liu Y, Liu Y, Wang L and Chen K 2005 A hybrid tabu search based clustering algorithm. In: Proceedings of the International Conference on Knowledge-Based and Intelligent Information and Engineering Systems. Berlin–Heidelberg: Springer, pp. 186–192

    Google Scholar 

  36. Armano G and Farmani M R 2014 Clustering analysis with combination of artificial bee colony algorithm and k-means technique. International Journal of Computer Theory and Engineering 6(2): 141

    Article  Google Scholar 

  37. Hatamlou A, Abdullah S and Nezamabadi-Pour H 2012 A combined approach for clustering based on K-means and gravitational search algorithms. Swarm and Evolutionary Computation 6: 47–52

    Article  Google Scholar 

  38. Hassanzadeh T and Meybodi M R 2012 A new hybrid approach for data clustering using firefly algorithm and K-means. In: Proceedings of the CSI International Symposium on Artificial Intelligence and Signal Processing (AISP), IEEE, pp. 007–011

  39. Komarasamy G and Wahi A 2012 An optimized K-means clustering technique using bat algorithm. European Journal of Scientific Research 84(2): 263–273

    Google Scholar 

  40. Tang R, Fong S, Yang, X S and Deb S 2012 Integrating nature-inspired optimization algorithms to K-means clustering. In: Proceedings of the Seventh International Conference on Digital Information Management (ICDIM), IEEE, pp. 116–123

  41. Asuncion A and Newman D 2007 UCI machine learning repository

  42. Van den Bergh F 2002 An analysis of particle swarm optimizers. PhD Thesis, Department of Computer Science, University of Pretoria, Pretoria, South Africa

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K Lakshmi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lakshmi, K., Visalakshi, N.K. & Shanthi, S. Data clustering using K-Means based on Crow Search Algorithm. Sādhanā 43, 190 (2018). https://doi.org/10.1007/s12046-018-0962-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12046-018-0962-3

Keywords

Navigation