Abstract
In this paper we show that there exists a (k, ε)-coreset for k-median and k-means clustering of n points in ℜd which is of size independent of n. In particular, we construct a (k, ε)-coreset of size O(k2 / εd) for k-median clustering, and of size O(k3 / εd+1) for k-means clustering. © 2006 Springer.
Cite
CITATION STYLE
APA
Har-Peled, S., & Kushal, A. (2007). Smaller coresets for k-median and k-means clustering. Discrete and Computational Geometry, 37(1), 3–19. https://doi.org/10.1007/s00454-006-1271-x
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free