A local search approximation algorithm for k-means clustering

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 10-18

  Kanungo, Tapas ^a   Mount, David M ^a   Netanyahu, Nathan S ^a   Piatko, Christine D ^a   Silverman, Ruth ^a   Wu, Angela Y ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Clustering; Computational geometry; k means; Local search

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

CLUSTERING PROBLEMS;

COMPUTATIONAL GEOMETRY;

EID: 0036361823     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513400.513402     Document Type: Conference Paper

References (33)

1. Exact and approximation algorithms for clustering
2. An efficient k-means clustering algorithm
3. Approximation schemes for Euclidean k-median and related problems
4. Local search heuristics for k-median and facility location problems
5. Some fundamental concepts and synthesis procedures for pattern recognition preprocessors
6. Clustering using simulated annealing with probabilistic redistribution
7. Geometric clusterings
8. Improved combinatorial algorithms for the facility location and k-medians problem
9. Centroidal Voronoi tesselations: Applications and algorithms
10. Using simulated annealing to design good codes
11. Clustering and the continuous k-means algorithm
12. Cluster analysis of multivariate data: Efficiency vs. interpretability of classification
13. Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering
14. Statistical pattern recognition: A review
15. Data clustering: A review
16. An efficient k-means clustering algorithm: Analysis and implementation
17. Optimization by simulated annealing
18. A nearly linear-time approximation scheme for the Euclidean k-median problem
19. Analysis of a local search heuristic for facility location problems
20. Some methods for classification and analysis of multivariate observations
21. On approximate geometric k-clustering
22. Efficient and effective clustering methods for spatial data mining
23. Accelerating exact k-means algorithms with geometric reasoning
24. x-means: Extending k-means with efficient estimation of the number of clusters
25. Acceleration of k-means and related clustering problems
26. Simulated annealing and codebook design