Towards Optimal Lower Bounds for k-median and k-means Coresets.
Vincent Cohen-AddadKasper Green LarsenDavid SaulpicChris SchwiegelshohnPublished in: CoRR (2022)
Keyphrases
- lower bound
- k means
- worst case
- upper bound
- optimal cost
- optimal solution
- objective function
- squared euclidean distance
- clustering algorithm
- clustering method
- dynamic programming
- branch and bound
- lower and upper bounds
- hierarchical clustering
- branch and bound algorithm
- rough k means
- optimal strategy
- noise reduction
- cluster analysis
- closed form
- self organizing maps
- edge detection