How slow is the k -means method?
- 5 June 2006
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 144-153
- https://doi.org/10.1145/1137856.1137880
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- How Fast Is the k-Means Method?Algorithmica, 2004
- k -means projective clusteringPublished by Association for Computing Machinery (ACM) ,2004
- Smoothed analysis of algorithmsJournal of the ACM, 2004
- How Fast Is k-Means?Lecture Notes in Computer Science, 2003
- A local search approximation algorithm for k-means clusteringPublished by Association for Computing Machinery (ACM) ,2002
- Large-Scale Clustering of cDNA-Fingerprinting DataGenome Research, 1999
- Applications of weighted Voronoi diagrams and randomization to variance-based k-clusteringPublished by Association for Computing Machinery (ACM) ,1994
- Extensions of Lipschitz mappings into a Hilbert spaceContemporary Mathematics, 1984
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982