Bipartition of graphs based on the normalized cut and spectral methods. I: Minimum normalized cut (Q2923301)
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: Bipartition of graphs based on the normalized cut and spectral methods. I: Minimum normalized cut |
scientific article; zbMATH DE number 6356027
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bipartition of graphs based on the normalized cut and spectral methods. I: Minimum normalized cut |
scientific article; zbMATH DE number 6356027 |
Statements
15 October 2014
0 references
spectral clustering
0 references
normalized Laplacian matrices
0 references
difference Laplacian matrices
0 references
signless Laplacian matrices
0 references
normalized cut
0 references
math.CO
0 references
cs.DM
0 references
Bipartition of graphs based on the normalized cut and spectral methods. I: Minimum normalized cut (English)
0 references
