How fast is the \(k\)-means method?

DOI10.1007/s00453-004-1127-9zbMath1069.68108OpenAlexW3138330851MaRDI QIDQ1763158

Sariel Har-Peled, Bardia Sadri

Publication date: 21 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1127-9

zbMATH Keywords

Lloyd's method

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

On the performance of the ICP algorithm, Local Search Yields a PTAS for $k$-Means in Doubling Metrics, \(k\)-means requires exponentially many iterations even in the plane, Frequency-based views to pattern collections, The Planar k-Means Problem is NP-Hard, Unnamed Item, Data clustering via cooperative games: a novel approach and comparative study, GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS, The approximation algorithm based on seeding method for functional \(k\)-means problem, A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM