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

DOI10.1016/S0898-1221(02)00165-7zbMath1055.65032MaRDI QIDQ1886488

Qiang Du, Tak-Win Wong

Publication date: 18 November 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

Probabilistic methods\(k\)-means algorithmsCentroidal Voronoi tessellations

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

Generalized \(k\)-means in GLMs with applications to the outbreak of COVID-19 in the United States ⋮ Distributed stochastic multi-vehicle routing in the Euclidean plane with no communications ⋮ Dynamic distributed clustering in wireless sensor networks via Voronoi tessellation control ⋮ Mesh generation for FEM based on centroidal Voronoi tessellations

Uses Software

• AS 136
• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• Asymptotic properties of univariate sample k-means clusters
• Strong consistency of k-means clustering
• A central limit theorem for k-means clustering
• Asymptotic distributions for clustering criteria
• Grid generation and optimization based on centroidal Voronoi tessellations
• A classification EM algorithm for clustering and two stochastic versions
• Convergence of Vector Quantizers with Applications to Optimal Quantization
• BOOTSTRAPPING K-MEANS CLUSTERING
• Centroidal Voronoi Tessellations: Applications and Algorithms
• Quantization

This page was built for publication: Numerical studies of MacQueen's \(k\)-means algorithm for computing the centroidal Voronoi tessellations