Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394)
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: Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering |
scientific article; zbMATH DE number 7212112
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering |
scientific article; zbMATH DE number 7212112 |
Statements
Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (English)
0 references
15 June 2020
0 references
semidefinite programming
0 references
graph partition
0 references
unsupervised learning
0 references
spectral clustering
0 references
community detection
0 references
graph Laplacian
0 references
0 references
0 references
0 references
0 references
0.8811377882957458
0 references
0.8022372126579285
0 references
0.7780672311782837
0 references
0.7695907950401306
0 references
0.7649608254432678
0 references
