Clustering large graphs via the singular value decomposition (Q703073): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55921971, #quickstatements; #temporary_batch_1711234560214 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/b:mach.0000033113.59016.96 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004791924 / rank | |||
Normal rank | |||
Latest revision as of 08:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Clustering large graphs via the singular value decomposition |
scientific article |
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
