Call for Paper - May 2023 Edition
IJCA solicits original research papers for the May 2023 Edition. Last date of manuscript submission is April 20, 2023. Read More

New Method for Finding Initial Cluster Centroids in K-means Algorithm

Print
PDF
 
Download Full Text
International Journal of Computer Applications
© 2013 by IJCA Journal
Volume 74 - Number 6
Year of Publication: 2013
Authors:
Harmanpreet Singh
Kamaljit Kaur
10.5120/12890-9837

Harmanpreet Singh and Kamaljit Kaur. Article: New Method for Finding Initial Cluster Centroids in K-means Algorithm. International Journal of Computer Applications 74(6):27-30, July 2013. Full text available. BibTeX

@article{key:article,
	author = {Harmanpreet Singh and Kamaljit Kaur},
	title = {Article: New Method for Finding Initial Cluster Centroids in K-means Algorithm},
	journal = {International Journal of Computer Applications},
	year = {2013},
	volume = {74},
	number = {6},
	pages = {27-30},
	month = {July},
	note = {Full text available}
}

Abstract

Data Mining is special field of computer science concerned with the automated extraction of patterns of knowledge implicitly stored in large databases, data warehouses and other large data repositories. Clustering is one of the Data Mining tasks which is used to cluster objects on the basis of their nearness to the central value. It is a method of grouping objects automatically. In clustering elements within same cluster are more similar than the elements in other clusters. K- Means is one the method of clustering which is used widely because it is simple and efficient. The output of the K Means depends upon the chosen central values for clustering. So accuracy of the K Means algorithm depends much on the chosen central values. The original K Means method chooses the initial cluster centroids randomly which affects its performance. This paper presents a new method for finding initial cluster centroids for K Means.

References

  • Jiawei Han, Data mining: concepts and techniques (Morgan Kaufman Publishers, 2006).
  • Margaret H Dunham, Data mining: introductory and advanced concepts (Pearson Education, 2006).
  • Pena, J. M. , Lozano, J. A. , Larranaga, P, An empirical comparison of four initialization methods for the K-Means algorithm, Pattern Recognition Letters 20 (1999) pp. 1027-1040.
  • Anderberg, M, Cluster analysis for applications (Academic Press, New York 1973).
  • Tou, J. , Gonzales, Pattern Recognition Principles (Addison-Wesley, Reading, MA, 1974).
  • Katsavounidis, I. , Kuo, C. , Zhang, Z. , A new initialization technique for generalized lloyd iteration, IEEE Signal Processing Letters 1 (10), 1994, pp. 144-146.
  • Bradley, P. S. , Fayyad, Refining initial points for K-Means clustering: Proc. 15th International Conf. on Machine Learning, San Francisco, CA, 1998, pp. 91-99.
  • Koheri Arai and Ali Ridho Barakbah, Hierarchical k-means: an algorithm for centroids initialization for k-means, Reports of The Faculty of Science and Engineering Saga University, vol. 36, No. 1, 2007.
  • Samarjeet Borah, M. K. Ghose, Performance Analysis of AIM-K-means & K- means in Quality Cluster Generation, Journal of Computing, vol. 1, Issue 1, December 2009.
  • Ye Yunming, Advances in knowledge discovery and data mining (Springer, 2006).
  • K. A. Abdul Nazeer and M. P. Sebastian, Improving the accuracy and efficiency of the k-means clustering algorithm, Proceedings of the World Congress on Engineering, London, UK, vol. 1, 2009.
  • Madhu Yedla, S. R. Pathakota, T. M. Srinivasa, Enhancing K-means Clustering Algorithm with Improved Initial Centre, International Journal of Computer Science and Information Technologies, 1 (2) , 2010, pp. 121-125.