On the tightness of an SDP relaxation of k-means.
Takayuki IguchiDustin G. MixonJesse PetersonSoledad VillarPublished in: CoRR (2015)
Keyphrases
- k means
- semi definite programming
- semidefinite
- semidefinite programming
- convex relaxation
- lower bound
- clustering algorithm
- clustering method
- hierarchical clustering
- data clustering
- iterative algorithms
- probabilistic relaxation
- linear programming relaxation
- spectral clustering
- fuzzy clustering algorithm
- cluster analysis
- dynamic programming
- objective function
- unsupervised clustering
- fuzzy k means
- squared euclidean distance
- convex optimization
- document clustering
- self organizing maps
- semi supervised learning
- higher dimensional
- interior point methods
- machine learning
- multi label
- trust region
- expectation maximization
- lognormal distribution
- supervised learning
- rough k means
- spectral relaxation