An efficient k-means clustering algorithms: Analysis and implementation

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 24, Issue 7, 2002, Pages 881-892

  Kanungo, Tapas ^a,b   Mount, David M ^a,c   Netanyahu, Nathan S ^a,d   Piatko, Christine D ^e   Silverman, Ruth ^f   Wu, Angela Y ^a,g  

^a IEEE   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c University of Maryland ^*  (United States)

^d BAR ILAN UNIVERSITY   (Israel)

^e JOHNS HOPKINS UNIVERSITY   (United States)

^f UNIVERSITY OF MARYLAND   (United States)

^g AMERICAN UNIVERSITY   (United States)

Author keywords

Computational geometry; Data mining; k d tree; k means clustering; Knowledge discovery; Machine learning; Nearest neighbor searching; Pattern recognition

Indexed keywords

COLOR QUANTIZATION; DATA-SENSITIVE ANALYSIS; FILTERING ALGORITHM; K-MEANS CLUSTERING ALGORITHM; NEAREST-NEIGHBOR SEARCHING;

COMPUTATIONAL METHODS; DATA COMPRESSION; DATA MINING; DATA REDUCTION; DATA STRUCTURES; IMAGE SEGMENTATION; LEARNING SYSTEMS; PATTERN RECOGNITION; THEOREM PROVING; VECTOR QUANTIZATION;

ALGORITHMS;

EID: 0036647190     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2002.1017616     Document Type: Article

References (50)

1. Exact and approximation algorithms for clustering
2. An efficient κ-means clustering algorithm
3. Approximation schemes for euclidean k-median and related problems
4. Approximate range searching
5. An optimal algorithm for approximate nearest neighbor searching
6. Some fundamental concepts and synthesis procedures for pattern recognition preprocessors
7. Multidimensional binary search trees used for associative searching
8. Convergence properties of the k-means algorithms
9. Refining initial points for K-means clustering
10. Scaling clustering algorithms to large databases
11. Geometric clusterings
12. A spatial filtering approach to texture analysis
13. Learning mixtures of Gaussians
14. A two-round variant of EM for Gaussian mixtures
15. Centroidal voronoi tesselations: Applications and algorithms
16. A database interface for clustering in large spatial databases
17. Clustering and the continuous k-means algorithm
18. Cluster analysis of multivariate data: Efficiency vs. interpretability of classification
19. Experimental results of a randomized clustering algorithm
20. Applications of weighted voronoi diagrams and randomization to variance-based k-clustering
21. Statistical pattern recognition: A review
22. Data clustering: A review
23. Computing nearest neighbors for moving points and applications to clustering
24. The analysis of a simple k-means clustering algorithm
25. The analysis of a simple k-means clustering algorithm
26. A nearly linear-time approximation scheme for the Euclidean k-median problem
27. Least squares quantization in PCM
28. Some methods for classification and analysis of multivariate observations
29. Analysis of approximate nearest neighbor searching with clustered point sets
30. Mathematical programming in data mining
31. On approximate geometric k-clustering
32. Very fast EM-based mixture model clustering using multiresolution kd-trees
33. ANN: A library for approximate nearest neighbor searching
34. Efficient and effective clustering methods for spatial data mining
35. Accelerating exact k-means algorithms with geometric reasoning
36. x-means: Extending k-means with efficient estimation of the number of clusters
37. A centeral limit theorem for k-means clustering
38. K-means-type algorithms: A generalized convergence theorem and characterization of local optimality
39. BIRCH: A new data clustering algorithm and its applications