A graph-theoretical clustering method based on two rounds of minimum spanning trees (Q2654240): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.patcog.2009.07.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.PATCOG.2009.07.010 / rank | |||
Normal rank | |||
Latest revision as of 13:24, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph-theoretical clustering method based on two rounds of minimum spanning trees |
scientific article |
Statements
A graph-theoretical clustering method based on two rounds of minimum spanning trees (English)
0 references
15 January 2010
0 references
graph-based clustering
0 references
well-separated cluster
0 references
touching cluster
0 references
two rounds of MST
0 references
0 references
0 references
