We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Review of Existing Methods for Finding Initial Clusters in K-means Algorithm

by Harmanpreet Singh, Kamaljit Kaur
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 68 - Number 14
Year of Publication: 2013
Authors: Harmanpreet Singh, Kamaljit Kaur
10.5120/11649-7148

Harmanpreet Singh, Kamaljit Kaur . Review of Existing Methods for Finding Initial Clusters in K-means Algorithm. International Journal of Computer Applications. 68, 14 ( April 2013), 24-28. DOI=10.5120/11649-7148

@article{ 10.5120/11649-7148,
author = { Harmanpreet Singh, Kamaljit Kaur },
title = { Review of Existing Methods for Finding Initial Clusters in K-means Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 68 },
number = { 14 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 24-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume68/number14/11649-7148/ },
doi = { 10.5120/11649-7148 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:27:51.299500+05:30
%A Harmanpreet Singh
%A Kamaljit Kaur
%T Review of Existing Methods for Finding Initial Clusters in K-means Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 68
%N 14
%P 24-28
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Clustering is one of the Data Mining tasks that can be used to cluster or group objects on the basis of their nearness to the central value. It has found many applications in the field of business, image processing, medical etc. 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. This paper presents the various methods evolved by researchers for finding initial clusters for K Means.

References
  1. Jiawei Han, Data mining: concepts and techniques (Morgan Kaufman Publishers, 2006).
  2. Margaret H Dunham, Data mining: introductory and advanced concepts (Pearson Education, 2006).
  3. 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.
  4. Anderberg, M, Cluster analysis for applications (Academic Press, New York 1973).
  5. M. E. Celebi, H. Kingravi, P. A. Vela, A Comparative Study of Efficient Initialization Methods for the K-Means Clustering Algorithm, Expert Systems with Applications, 40(1), 2013, pp. 200-210.
  6. Tou, J. , Gonzales, Pattern Recognition Principles (Addison-Wesley, Reading, MA, 1974).
  7. Katsavounidis, I. , Kuo, C. , Zhang, Z. , A new initialization technique for generalized lloyd iteration, IEEE Signal Processing Letters 1 (10), 1994, pp. 144-146.
  8. Takashi Onoda, Miho Sakai, Seiji Yamada, Careful Seeding Method based on Independent Components Analysis for k-means Clustering, Journal Of Emerging Technologies In Web Intelligence, vol. 4, No. 1, February 2012.
  9. Stephen J. Redmond, Conor Heneghan, A method for initialising the K-means clustering algorithm using kd-trees, Pattern Recognition Letters 28(8), 2007, pp. 965-973.
  10. 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.
  11. Fernando Bacao, Victor Lobo, Marco Painho, Self-organizing maps as substitutes for K-means clustering, Computers and Geosciences, vol. 31, Elsevier, 2005, pp. 155-163.
  12. Khan, S. S. , Ahmad, A. , Cluster center initialization algorithm for k-means clustering, Pattern Recognition Letters 25 (11), 2004, pp. 1293-1302.
  13. Shehroz S. Khan, Shri Kant, Computation of initial modes for k-modes clustering algorithm using evidence accumulation, 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 2007, pp. 2784-2789.
  14. 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.
  15. S. A. Majeed, H. Husain, S. A. Samad, A. Hussain, Hierarchical k-means algorithm applied on isolated Malay digit speech recognition, International Conference on System Engineering and Modeling, vol. 34, Singapore, 2012.
  16. 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.
  17. 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.
  18. 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.
Index Terms

Computer Science
Information Sciences

Keywords

Automatic Initialisation of Means (AIM) Cluster Centre Initialisation (CCIA) Simple Cluster-Seeking (SCS)

Powered by PhDFocusTM