A tight lower bound instance for k-means++ in constant dimension.
Anup BhattacharyaRagesh JaiswalNir AilonPublished in: CoRR (2014)
Keyphrases
- lower bound
- k means
- upper bound
- branch and bound
- branch and bound algorithm
- arbitrarily close
- constant factor
- clustering method
- lower and upper bounds
- worst case
- clustering algorithm
- spectral clustering
- np hard
- objective function
- optimal solution
- self organizing maps
- hierarchical clustering
- lower bounding
- cluster analysis
- document clustering
- fuzzy k means
- sample complexity
- data clustering
- cluster centers
- unsupervised clustering
- online algorithms
- data sets