The week's pick
Random Articles
Reseach Article
Analysis of Initial Centers for k-Means Clustering Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 71 - Number 5 |
| Year of Publication: 2013 |
| Authors: M. P. S Bhatia, Deepika Khurana |
10.5120/12352-8654
|
M. P. S Bhatia, Deepika Khurana . Analysis of Initial Centers for k-Means Clustering Algorithm. International Journal of Computer Applications. 71, 5 ( June 2013), 9-12. DOI=10.5120/12352-8654
Abstract
Data Analysis plays an important role for understanding different events. Cluster Analysis is widely used data mining technique for knowledge discovery. Clustering has wide applications in the field of Artificial Intelligence, Pattern Matching, Image Segmentation, Compression, etc. Clustering is the process of finding the group of objects such that objects in one group will be similar to one another and different from the objects in the other group. k-Means clustering algorithm is one of the popular algorithm which has gained a lot of attraction because of its simplicity and ease of implementation. k-Means algorithm's efficiency is limited because of random selection of k initial centers. Therefore, we have surveyed different approaches for initial centers selection for k-Means algorithm. We have also shown comparative analysis of Original K-Means and Data Clustering with Modified k-Means Algorithm using MATLAB R2009b. We chose Euclidean distance as the similarity measure for our implementation and results are evaluated.
References
- Ran Vijay Singh and M. P. S Bhatia, "Data Clustering with Modified K-Means Algorithm", IEEE International Conference on Recent Trends in Information Technology, ICRTIT 2011, pp 717-721.
- D. Napoleon and P. Ganga Lakshmi, "An Efficient K-Means Clustering Algorithm for Reducing Time Complexity using Uniform Distribution Data Points", IEEE 2010.
- Tajunisha and Saravanan, "Performance Analysis of k-Means with different initialization methods for high dimensional data" International Journal of Artificial Intelligence & Applications (IJAIA), Vol. 1, No. 4, October 2010
- Neha Aggarwal and Kriti Aggarwal, "A Mid- point based k –mean Clustering Algorithm for Data Mining". International Journal on Computer Science and Engineering (IJCSE) 2012.
- Barileé Barisi Baridam, "More work on k-Means Clustering algortithm: The Dimensionality Problem ". International Journal of Computer Applications (0975 – 8887)Volume 44– No. 2, April 2012.
- Shi Na, Li Xumin, Guan Yong "Research on K-Means clustering algorithm". Proc of Third International symposium on Intelligent Information Technology and Security Informatics, IEEE 2010.
- Ahamad Shafeeq and Hareesha "Dynamic clustering of data with modified K-mean algorithm", Proc. International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) © (2012) IACSIT Press, Singapore 2012.
- Kohei Arai,Ali Ridho Barakbah, "Hierarchical K-Means: an algorithm for centroids initialization for K-Means.
- Data Mining Concepts and Techniques,Second edition Jiawei Han and Micheline Kamber.
- D. T Pham, S. S Dimov, C. D Nguyen, "Selection of k in k means clustering".
- Paul S. Bradley, Usama M. Fayyad, "Refining Initial Points for K-MeansClustering", 15th International Conference on Machine Learning (ICML98).
- K. A. Abdul Nazeer, M. P. Sebastian, "Improving the Accuracy and Efficiency of the k-Means Clustering Algorithm", Proceeding of the World Congress on Engineering,vol 1,london, July 2009.
- T Velmurugan and T Santhanam "A survey of partition based clustering algorithms in data mining: An experimental approach". Proc. Information Technology Journal 2011.
Index Terms
Keywords