Clustering is semidefinitely not that hard: Nonnegative SDP for manifold disentangling.
Mariano TepperAnirvan M. SenguptaDmitri B. ChklovskiiPublished in: J. Mach. Learn. Res. (2018)
Keyphrases
- k means
- clustering algorithm
- clustering method
- matrix factorisation
- semi definite programming
- nonnegative matrix factorization
- linear programming
- cluster analysis
- data clustering
- manifold learning
- self organizing maps
- hierarchical clustering
- semidefinite programming
- dimensionality reduction
- high dimensional data
- generative topographic mapping
- graph embedding
- semidefinite
- negative matrix factorization
- categorical data
- euclidean space
- document clustering