Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:11, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering |
scientific article |
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
