Journal of Zhejiang University. Science A · 2006 · 346 citations · 14 references
ComputingComputer ScienceData MiningMachine LearningCluster DetectionDimensionality ReductionDocument ClusteringText ClusteringClusteringK-means Clustering
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.
14
A density-based algorithm for discovering clusters in large spatial Databases with Noise
Martin Ester, Hans‐Peter Kriegel, Jörg Sander et al. · 1996 · 19.1K citations
Finding groups in data: an introduction to cluster analysis
Choice Reviews Online · 1991 · 10.6K citations
Algorithms for Clustering Data
Warren S. Sarle, Anil K. Jain, Richard C. Dubes · Technometrics · 1990 · 7.8K citations
Mihael Ankerst, Markus Breunig, Hans‐Peter Kriegel et al. · ACM SIGMOD Record · 1999 · 4K citations · Full text