Tight lower bound instances for k-means++ in two dimensions.
Anup BhattacharyaRagesh JaiswalNir AilonPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- lower bound
- lower and upper bounds
- k means
- upper bound
- quadratic assignment problem
- linear programming relaxation
- branch and bound algorithm
- branch and bound
- set of randomly generated instances
- random instances
- pseudo boolean optimization
- clustering algorithm
- worst case
- randomly generated
- np hard
- families of valid inequalities
- clustering method
- hierarchical clustering
- optimal solution
- objective function
- lower bounding
- spectral clustering
- finding optimal solutions
- vc dimension
- lagrangian relaxation
- expectation maximization
- valid inequalities
- max sat
- document clustering
- sample complexity
- self organizing maps
- data clustering
- column generation
- cluster analysis