Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters (Q1017654): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2122218279 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0912.3408 / rank | |||
Normal rank | |||
Revision as of 19:43, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
