Direct reading algorithm for hierarchical clustering (Q509277)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6682408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Direct reading algorithm for hierarchical clustering |
scientific article; zbMATH DE number 6682408 |
Statements
Direct reading algorithm for hierarchical clustering (English)
0 references
9 February 2017
0 references
analytics
0 references
hierarchical clustering
0 references
ultrametric topology
0 references
\(p\)-adic and \(m\)-adic number representation
0 references
linear-time computational complexity
0 references
0.7927791476249695
0 references
0.7671943306922913
0 references
0.7669616937637329
0 references
0.7526471614837646
0 references
