Competitive K-Means, a New Accurate and Distributed K-Means Algorithm for Large Datasets

Citations Over TimeTop 10% of 2013 papers

Abstract

The tremendous growth in data volumes has created a need for new tools and algorithms to quickly analyze large datasets. Cluster analysis techniques, such as K-means can be used for large datasets distributed across several machines. The accuracy of K-means depends on the selection of seed centroids during initialization. K-means++ improves on the K-means seeder, but suffers from problems when it is applied to large datasets: (a) the random algorithm it employs can produce inconsistent results across several analysis runs under the same initial conditions; and (b) it scales poorly for large datasets. In this paper we describe a new Competitive K-means algorithm we developed that addresses both of these problems. We describe an efficient MapReduce implementation of our new Competitive K-means algorithm that we found scales well with large datasets. We compared the performance of our new algorithm with three existing cluster analysis algorithms and found that our new algorithm improves cluster analysis accuracy and decreases variance. Our results show that our new algorithm produced a speedup of 76 ± 9 times compared with the serial K-means++ and is as fast as the Streaming K-means. Our work provides a method to select a good initial seeding in less time, facilitating accurate cluster analysis over large datasets in shorter time.

Related Papers

• → Another view on parallel speedup(1990)102 cited
• → Toward a better parallel performance metric(1991)97 cited
• → Performance considerations of shared virtual memory machines(1995)24 cited
• → Speedup for Multi-Level Parallel Computing(2012)8 cited
• → Shared virtual memory and generalized speedup(2002)12 cited