A practical comparison of two K-Means clustering algorithmsReport as inadecuate

A practical comparison of two K-Means clustering algorithms - Download this document for free, or read online. Document in PDF available to download.

BMC Bioinformatics

, 9:S19

First Online: 28 May 2008


BackgroundData 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.

ResultsIn 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.

ConclusionBased 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.

Download fulltext PDF

Author: Gregory A Wilkin - Xiuzhen Huang

Source: https://link.springer.com/

Related documents