Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds.
Nikhil BansalVincent Cohen-AddadMilind PrabhuDavid SaulpicChris SchwiegelshohnPublished in: CoRR (2024)
Keyphrases
- worst case
- k means
- upper bound
- lower bound
- average case
- approximation algorithms
- greedy algorithm
- sample size
- error bounds
- worst case analysis
- worst case bounds
- np hard
- loss bounds
- dynamic programming
- theoretical guarantees
- vc dimension
- random sampling
- computational complexity
- sampling methods
- mistake bound
- constant factor
- tight bounds
- clustering algorithm
- optimal solution
- hierarchical clustering
- running times
- variance reduction
- cluster analysis
- stability of feature selection
- learning algorithm