An efficient enhanced k-means clustering algorithm
- 1 October 2006
- journal article
- Published by Zhejiang University Press in Journal of Zhejiang University-SCIENCE A
- Vol. 7 (10), 1626-1633
- https://doi.org/10.1631/jzus.2006.a1626
Abstract
In k-means clustering, we are given a set of n data points in d-dimensional space ℝd and an integer k and the problem is to determine a set of k points in ℝd, called centers, so as to minimize the mean squared distance from each data point to its nearest center. In this paper, we present a simple and efficient clustering algorithm based on the k-means algorithm, which we call enhanced k-means algorithm. This algorithm is easy to implement, requiring a simple data structure to keep some information in each iteration to be used in the next iteration. Our experimental results demonstrated that our scheme can improve the computational speed of the k-means algorithm by the magnitude in the total number of distance calculations and the overall time of computation.Keywords
This publication has 7 references indexed in Scilit:
- An Iterated Local Search Approach for Minimum Sum-of-Squares ClusteringLecture Notes in Computer Science, 2003
- OPTICSACM SIGMOD Record, 1999
- Automatic subspace clustering of high dimensional data for data mining applicationsPublished by Association for Computing Machinery (ACM) ,1998
- CUREPublished by Association for Computing Machinery (ACM) ,1998
- Vector Quantization and Signal CompressionPublished by Springer Science and Business Media LLC ,1992
- Finding Groups in DataWiley Series in Probability and Statistics, 1990
- SLINK: An optimally efficient algorithm for the single-link cluster methodThe Computer Journal, 1973