期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2011
卷号：2
期号：4Ver1
出版社：Ayushmaan Technologies
摘要：Clustering is the process of organizing data objects into a set of disjoint classes called clusters. Clustering is an example of unsupervised classification. Cluster analysis seeks to partition a given data set into groups based on specified features so that the data points within a group are more similar to each other than the points in different groups Cluster analysis is one of the primary data analysis methods and k-means is one of the most well known popular clustering algorithms. The k-means algorithm is one of the frequently used clustering methods in data mining, due to its performance in clustering massive data sets. The final clustering result of the k- means clustering algorithm greatly depends upon the correctness of the initial centroids, which are selected randomly. A new method is proposed for finding the better initial centroids and to provide an efficient way of assigning the data points to suitable clusters with reduced time complexity. The proposed algorithm has the more accuracy with less computational time comparatively original k-means clustering algorithm.
关键词：Clustering;k-means;timecomplexity;centroid; data sets..
