A Tight Lower Bound Instance for k-means++ in Constant Dimension.
Anup BhattacharyaRagesh JaiswalNir AilonPublished in: TAMC (2014)
Keyphrases
- lower bound
- k means
- upper bound
- worst case
- branch and bound algorithm
- arbitrarily close
- constant factor
- branch and bound
- np hard
- clustering algorithm
- lower and upper bounds
- objective function
- lower bounding
- unsupervised clustering
- cluster analysis
- optimal solution
- competitive ratio
- upper and lower bounds
- initial cluster centers
- spectral clustering
- self organizing maps
- vc dimension
- cluster centers
- clustering method
- fuzzy c means
- hierarchical clustering
- linear programming relaxation
- constrained clustering
- data clustering
- document clustering
- expectation maximization