On coresets for k-means and k-median clustering
In this paper, we show the existence of small coresets for the problems of computing k-median and k-means clustering for points in low dimension. In other words, we show that gi...
Publications
2 shownHow fast is the k-means method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are pol...
Frequent Co-Authors
Researcher Info
- h-index
- 2
- Publications
- 2
- Citations
- 532
- Institution
- University of Illinois Urbana-Champaign
External Links
Identifiers
- ORCID
- 0000-0003-2638-9635
Impact Metrics
h-index
2
h-index: Number of publications with at least h citations each.