期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：2
出版社：S.S. Mishra
摘要：C Clustering is the process of grouping of data, where the grouping is established by finding simil arities between data based on their characteristics. Such groups are termed as Clusters. A comparative study of clustering algorithms across two different data items is performed here. The performance of the various clustering algorithms is compared based on the time taken to form the estimated clusters. The experimental results of various clustering algorithms to form clusters are depicted as a graph. Thus it can be concluded as the time taken to form the clusters increases as the number of cluster increases. The farthest first clustering algorithm takes very few seconds to cluster the data items whereas the simple KMeans takes the longest time to perform clustering.
关键词：Clustering; Clustering algorithms; KMeans; Efficient KMeans; Filtered cluster; Make density based cluster; ;Farthest first
