A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. (Q1423266)
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: A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. |
scientific article; zbMATH DE number 2041708
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. |
scientific article; zbMATH DE number 2041708 |
Statements
A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. (English)
0 references
14 February 2004
0 references
Nearest neighbors graph
0 references
Minimal spanning tree
0 references
Clustering
0 references
0 references
