Sciweavers

Share
BMCBI
2008

A practical comparison of two K-Means clustering algorithms

10 years 1 months ago
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: kmeans clustering. Our experimentation compares the running times and distance efficiency of Lloyd's K-means Clustering and the Progressive Greedy K-means Clustering. Conclusion: 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 threedimensional space. However, other circumstances may dictate a different choice in some situations. Background Researchers are inundated with data with little obvious information r...
Gregory A. Wilkin, Xiuzhen Huang
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where BMCBI
Authors Gregory A. Wilkin, Xiuzhen Huang
Comments (0)
books