Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling (Q4614130)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling |
scientific article; zbMATH DE number 7008338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling |
scientific article; zbMATH DE number 7008338 |
Statements
30 January 2019
0 references
K-means
0 references
semidefinite programming
0 references
manifolds
0 references
conditional gradient method
0 references
0 references
0.7978485226631165
0 references
0.7525864839553833
0 references
0.7404284477233887
0 references
0.7394316792488098
0 references
