Adaptive Sampling for k-Means Clustering
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 15-28
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- NP-hardness of Euclidean sum-of-squares clusteringMachine Learning, 2009
- The Planar k-Means Problem is NP-Hard2009
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their ApplicationsSIAM Journal on Computing, 2009
- A local search approximation algorithm for k-means clusteringComputational Geometry, 2004
- Clustering data streams: theory and practiceIEEE Transactions on Knowledge and Data Engineering, 2003
- A Constant-Factor Approximation Algorithm for the k-Median ProblemJournal of Computer and System Sciences, 2002
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxationJournal of the ACM, 2001
- On Approximate Geometric k -ClusteringDiscrete & Computational Geometry, 2000
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982