The analysis of a simple k -means clustering algorithm
From MaRDI portal
Publication:5361520
DOI10.1145/336154.336189zbMath1373.68466OpenAlexW2047588761MaRDI QIDQ5361520
Tapas Kanungo, Nathan S. Netanyahu, David M. Mount, Christine D. Piatko, Angela Y. Wu, Ruth Silverman
Publication date: 29 September 2017
Published in: Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/336154.336189
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms (68W40)
Related Items
Unsupervised classification of children's bodies using currents ⋮ A novel cognitive transformation algorithm based on Gaussian cloud model and its application in image segmentation ⋮ 3D human posture segmentation by spectral clustering with surface normal constraint ⋮ Efficiently summarizing attributed diffusion networks ⋮ Centroidal Voronoi tessellation algorithms for image compression, segmentation, and multichannel restoration ⋮ A Bayesian approach to unsupervised multiscale change detection in synthetic aperture radar images ⋮ Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems ⋮ Fuzzy clustering using multiple Gaussian kernels with optimized-parameters ⋮ Clustering large data sets described with discrete distributions and its application on TIMSS data set ⋮ An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers ⋮ A fast k-prototypes algorithm using partial distance computation