Density-based O-means clustering algorithm using minimum spanning tree (Q2833282)
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: Density-based O-means clustering algorithm using minimum spanning tree |
scientific article; zbMATH DE number 6654002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Density-based O-means clustering algorithm using minimum spanning tree |
scientific article; zbMATH DE number 6654002 |
Statements
Density-based O-Means clustering algorithm using minimum spanning tree (English)
0 references
17 November 2016
0 references
Euclidean minimum spanning tree
0 references
clustering
0 references
cluster separation
0 references
object density
0 references
outliers
0 references
0 references
0 references
0.7887237071990967
0 references
0.774264395236969
0 references
0.7705466151237488
0 references
0.7665264010429382
0 references
0.7664964199066162
0 references
