Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters (Q1017654)
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: Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters |
scientific article |
Statements
Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters (English)
0 references
12 May 2009
0 references
clustering
0 references
neighborhood graph
0 references
random geometric graph
0 references
connected component
0 references
0 references
0.8989817
0 references
0.8655337
0 references
0.8654021
0 references
0.8639108
0 references
0.86321074
0 references
