A Review of K-mean Algorithm

  ijett-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
© 2013 by IJETT Journal
Volume-4 Issue-7                      
Year of Publication : 2013
Authors : Jyoti Yadav , Monika Sharma


Jyoti Yadav , Monika Sharma. "A Review of K - mean Algorithm". International Journal of Engineering Trends and Technology (IJETT). V4(7):2972-2976 Jul 2013. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group.


Clu ster analysis is a descriptive task that seek to identify homogenous group of object and it is also one of the main analytical method in data mining. K - mean is the most popular partitional clustering method. In this paper we discuss standard k - mean algori thm and analyze the shortcoming of k - mean algorithm. In this paper three dissimilar modified k - mean algorithm are discussed which remove the limitation of k - mean algorithm and improve the speed and efficiency of k - mean algorithm. First algorithm remove the requirement of specifying the value of k in advance practically which is very difficult. This algorithm result in optimal number of cluster Second algorithm reduce computational complexity and remove dead unit problem. It select the most populated area a s cluster center. Third algorithm use simple data structure that can be used to store information in each iteration and that information can be used in next iteration. It increase the speed of clustering and reduce time complexity.


[1] Ahamed Shafeeq B M, Hareesha K S “ Dynamic Clustering of Data with Modifie d K - Means Algorithm” International Conference on Information and Computer Networks vol. 27, pp.221 - 225, 2012 .
[2] Shi Na, Liu Xumin, Guan yong “ Research on k - means Clustering Algorithm” Third International Symposium on Intelligent Information Technolo gy and Security Informatics,IEEE 2010, pp. 63 - 67.
[3] Ran Vijay Singh, M.P.S Bhatia “ Data Clustering with Modified K - means Algorithm” IEEE - International Conference on Recent Trends in Information Technology (ICRTIT), pp. 717 - 721, 2011.
[4] Jian Zhu, Hanshi Wang “ An improved K - means Clustering Algorithm” 2010 IEEE
[5] Han J. and Kamber M. “Data Mining: Concepts and Techniques,” Morgan Kaufmann Publishers , San Francisco, 2000.
[6] S. Prakash kumar and K. S. Ramaswami, “Efficient Cluster Validation with K - Fam ily Clusters on Quality Assessment”, European Journal of Scientific Research, 2011, pp.25 - 36.
[7] Sun Shibao, Qin Keyun,”Research on Modified k - means Data Cluster Algorithm” Computer Engineering, vol.33, pp.200 – 201,July 2007.
[8] D. Napol eon, P. Ganga lakshmi “An Efficient K - Means Clustering Algorithm for Reducing Time Complexity using Uniform Distribution Data Point” IEEE 2010, pp. 42 - 45.

Cluste ring, K - mean, Computational Complexity