Coresets for Deletion-Robust k-Center Clustering
Abstract
References
Index Terms
- Coresets for Deletion-Robust k-Center Clustering
Recommendations
On coresets for k-means and k-median clustering
STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computingIn 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 given a point set P in Rd, one can compute a weighted set S ⊆ P, of size O(k ε-...
On Coresets for $k$-Median and $k$-Means Clustering in Metric and Euclidean Spaces and Their Applications
We present new approximation algorithms for the $k$-median and $k$-means clustering problems. To this end, we obtain small coresets for $k$-median and $k$-means clustering in general metric spaces and in Euclidean spaces. In $\mathbb{R}^d$, these ...
Coresets for kernel clustering
AbstractWe devise coresets for kernel -Means with a general kernel, and use them to obtain new, more efficient, algorithms. Kernel -Means has superior clustering capability compared to classical -Means, particularly when clusters are non-linearly ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Short-paper
Funding Sources
Conference
Acceptance Rates
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 70Total Downloads
- Downloads (Last 12 months)70
- Downloads (Last 6 weeks)15
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in