A practical comparison of two K-Means clustering algorithms.
BACKGROUND
Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementations of clustering algorithms yield the same performance or the same clusters.


RESULTS
In this paper, we study two implementations of a general method for data clustering: k-means clustering. Our experimentation compares the running times and distance efficiency of Lloyd's K-means Clustering and the Progressive Greedy K-means Clustering.


CONCLUSIONS
Based on our implementation, not just in processing time, but also in terms of mean squared-difference (MSD), Lloyd's K-means Clustering algorithm is more efficient. This analysis was performed using both a gene expression level sample and on randomly-generated datasets in three-dimensional space. However, other circumstances may dictate a different choice in some situations.
Department of Computer Science, Arkansas State University, Arkansas 72467, USA. awilkin@csm.astate.edu
Gregory A
GA
Wilkin
Xiuzhen
X
Huang
D000465:Algorithms; D016000:Cluster Analysis; D003198:Computer Simulation; D020869:Gene Expression Profiling / Q000379:methods*; D008954:Models, Biological; D005810:Multigene Family / Q000502:physiology*; D010363:Pattern Recognition, Automated / Q000379:methods; D020543:Proteome / Q000378:metabolism*; D015398:Signal Transduction / Q000502:physiology*
D020543:Proteome