Abstract
In this paper we show that there exists a \((k,\varepsilon)\)-coreset for k-median and k-means clustering of n points in \({\cal R}^d,\) which is of size independent of n. In particular, we construct a \((k,\varepsilon)\)-coreset of size \(O(k^2/\varepsilon^d)\) for k-median clustering, and of size \(O(k^3/\varepsilon^{d+1})\) for k-means clustering.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Har-Peled, S., Kushal, A. Smaller Coresets for k-Median and k-Means Clustering. Discrete Comput Geom 37, 3–19 (2007). https://doi.org/10.1007/s00454-006-1271-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-006-1271-x