Designing a New Hybrid K-Means Optimization Algorithm

Navreet Kaur, Shruti Aggarwal


Abstract- Clustering is an unsupervised learning process with the main objective of organizing data into certain clusters and groups such that the data objects in the same cluster have higher similarity but dissimilar to the objects in other clusters. Many algorithms have been presented till now. These algorithms are k-means algorithm, hybrid k-means algorithms, and variants of k-means. The hybrid k-means optimization algorithms are those that combines k-means algorithm with various optimization algorithms like KBAT, CGA, KFA etc. The k-means algorithms have many problems like k-means algorithm converges to local minima rather than giving a global optimum results, hybrid k-mean algorithms have accuracy and efficiency problems. A new hybrid k-means optimization clustering algorithm is presented in the proposed study to solve the problems of existing k-means algorithm and hybrid k-mean algorithms. The output parameters like intra cluster distance, purity, recall etc are use to compare the performance of existing hybrid k-means algorithm with a new hybrid k-means optimization clustering algorithm. The results of these output parameters show that the proposed ABCGA technique is more efficient and it requires less computational time than existing hybrid k-means algorithm. Also the recall and purity of proposed hybrid algorithm is better than existing hybrid k-means algorithms and k-means algorithm but still there is scope for improvement in the proposed technique to extend this approach to handle variety of situations and information.


Keywords- Data mining, Clustering, K-means algorithm, Clustering based genetic algorithm, ABPPO algorithm, ABCGA technique

Full Text:



Ming-Syan Chen, Jiawei Han, Ps Yu, “Data Mining: An overview from database perspective” IEEE Transaction on knowledge and data engineering, Vol. 8, Issue 6, pp. 886-883, 1996.

Anil .Jan, “Data Clustering: 50 years beyond k-means” Pattern Recognition Letters, Elsevier, Vol. 31, pp. 651-666, 2010.

Lior Rokach and Oded Maimon, “Clustering methods” Data mining and Knowledge handbook, pp. 321-352, 2005.

J.B. MacQueen, “Some Methods for Classification and Analysis of Multivariate Observations” Proceedings of Fifth Berkeley Symposium on Mathematics Statistics and Probability, University of California Press, Vol. 1, pp. 281-297, 1967.

M.Mary and Shanthi Rani, “A Genetic Algorithm Based K-Means Algorithm For Compressing Images” International Journal Of Engineering And Computer Science ISSN, Vol. 4, Issue 9, pp. 14359-14362, 2015.

S.J Nanda, G. Panda, “A Survey on nature inspired metaheuristic algorithm for partition clustering” Swarm and Evolutionary Computation, Elsevier, Vol. 16, pp. 1-18, 2014.

Xin-She Yang, "Firefly algorithms for multimodal optimization" Stochastic Algorithms: Foundations and Applications, SAGA 2009. Lecture Notes in Computer Sciences, Vol.5792, pp.169–178, 2009.

K.Aparana and Mydhili K.Nair, “Enhancement of k-means algorithm using ACO as optimization technique on high dimensional data” 2014 international conference on Electronics and Communication Systems (ICECS) IEEE, pp. 1-5, 2014.

Taher Niknam and Babak Amiri, “An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis” Applied Soft Computing, Elsevier, vol. 10, pp. 183–197, 2010.

Saida Ishak Boushaki, Kamel Nadjet and Omar Bendjeghaba, “ A New Hybrid Algorithm for Document Clustering based on Cuckoo Search and K-means”, Recent advances on Soft Computing and Data Mining SCDM Springer, pp. 59-68, Vol. 287, 2014.

Tang Rui, Fong Simon, Yang Xin-She and Deb Sujay, “Integrating nature-inspired optimization algorithms to k-means clustering” 2012 seventh International Conference on Digital Information Management ICDIM, IEEE, pp. 116-123, 2012.

E. Obsab, X. S. yang, F. Diaz, P. Lopez-Garcia, R. Carballedo, “An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems”, Engineering Applications of Artificial Intelligence, Vol. 48, pp. 59-71, 2016.

Karaboga K, Dervis D, Ozturk, “A novel clustering approach: Artificial Bee Colony (ABC) algorithm” Applied Soft Computing, Springer, Vol. 11, pp. 7-652, 2011.

Hamed Nikbakht, Hamid Mirvaziri, “A new clustering approach based on K-means and Krill Herd algorithm” 23rd Iranian Conference on Electrical Engineering, IEEE, 2015.

Monica Sood and Shilpi Bansal, “K-Medoids Clustering Technique using Bat Algorithm”, International Journal of Applied Information Systems, pp. 20-22, 2013.

Minghao Yin, Yanmei Hu, Fengqin Yang, Xiangtao Li, Wenxiang Gu, “A novel hybrid K- harmonic means and gravitational search algorithm approach For clustering” Expert Systems with Applications, Elsevier, Vol. 38, pp. 9319-9324, 2011.

Yucheng Kao, Szu-Yuan Lee, “Combining K-means and particle swarm optimization for dynamic data clustering problems”, IEEE International Conference on Intelligent Computing and Intelligent Systems, 2009.

Kennedy.J and Eberhart.R, "Particle Swarm Optimization" Proceedings of IEEE International Conference on Neural Networks. pp. 1942–1948, 1995.

Gungor. Z and Unler. A, "k-Harmonic Means Data Clustering with Tabu Search Method" Applied Mathematical Modeling, Vol. 32, pp. 1115-1125, 2008.

A.M. Aibinu, H.Bello Salau, Najeeb Arthur Rahman, M.N. Nwohu, C.M. Akachukwu, “A novel Clustering based Genetic Algorithm for route optimization”, Engineering Science and Technology an International Journal, Vol. 19, pp. 2022–2034, 2016.

Ananthy Christy, Perianayagam Ajay-D-Vimal Raj, Sanjeevikumar Padmanaban, Rajasekar Selvamuthukumaran, Ahmet H.Ertas, “A bio-inspired novel optimization technique for reactive power flow”, Engineering Science and Technology an International Journal, Vol. 19, pp. 1682-1692, 2016.



  • There are currently no refbacks.

Copyright (c) 2017 International Journal of Advanced Research in Computer Science