Numerical studies of MacQueen's k-means algorithm for computing the centroidal Voronoi tessellations

Computers and Mathematics with Applications

Volumn 44, Issue 3-4, 2002, Pages 511-523

  Du, Qiang ^a,b   Wong, Tak Win ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Centroidal Voronoi tessellations; k means algorithms; Probabilistic methods

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; PROBABILISTIC LOGICS; RANDOM NUMBER GENERATION; SAMPLING;

PROBABILISTIC METHODS;

COMPUTATIONAL METHODS;

EID: 0036681212     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(02)00165-7     Document Type: Article

References (22)

1. Centroidal voronoi tessellations: Applications and algorithms
2. Quantization
3. A fast Voronoi-diagram algorithm with applications to geographical optimization problems
4. Grid generation and optimization based on the centroidal Voronoi tessellations
5. Some methods for classification and analysis of multivariate observations
6. Convergence of vector quantizers with applications to optimal quantization
7. A classification EM algorithm for clustering and two stochastic versions
8. A remark on algorithm AS136: K-means clustering algorithm
9. Asymptotic distribution for clustering centers
10. A k-means clustering algorithm
11. Bootstrapping k-means clustering
12. On the stability of k-means clustering in metric spaces
13. Strong consistency of k-mean clustering
14. Voronoi diagrams and Delaunay triangulations
15. Strong consistency of k-means clustering criterion in separable metric spaces
16. A central limit theorem for k-meanS clustering
17. Asymptotics of k-means clustering based on projection pursuit
18. Asymptotic properties of univariate sample k-means clusters