|International Journal of Computer Applications
|Foundation of Computer Science (FCS), NY, USA
|Volume 74 - Number 6
|Year of Publication: 2013
|Authors: Harmanpreet Singh, Kamaljit Kaur
Harmanpreet Singh, Kamaljit Kaur . New Method for Finding Initial Cluster Centroids in K-means Algorithm. International Journal of Computer Applications. 74, 6 ( July 2013), 27-30. DOI=10.5120/12890-9837
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.