Clustering large graphs via the singular value decomposition (Q703073)
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 large graphs via the singular value decomposition |
scientific article; zbMATH DE number 2129670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clustering large graphs via the singular value decomposition |
scientific article; zbMATH DE number 2129670 |
Statements
Clustering large graphs via the singular value decomposition (English)
0 references
19 January 2005
0 references
Singular Value Decomposition
0 references
randomized algorithms
0 references
\(k\)-means clustering
0 references
0.9741417765617372
0 references
0.79594486951828
0 references
0.79594486951828
0 references
0.7918195128440857
0 references
