Direct reading algorithm for hierarchical clustering (Q509277): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2016.11.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2559377253 / rank | |||
Normal rank | |||
Revision as of 01:40, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Direct reading algorithm for hierarchical clustering |
scientific article |
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
