A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. (Q1423266): Difference between revisions
From MaRDI portal
Latest revision as of 13:58, 6 June 2024
scientific article
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 |
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