Direct reading algorithm for hierarchical clustering (Q509277): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.endm.2016.11.006 / rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68P99 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 62H30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6682408 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
analytics | |||
Property / zbMATH Keywords: analytics / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hierarchical clustering | |||
Property / zbMATH Keywords: hierarchical clustering / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
ultrametric topology | |||
Property / zbMATH Keywords: ultrametric topology / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(p\)-adic and \(m\)-adic number representation | |||
Property / zbMATH Keywords: \(p\)-adic and \(m\)-adic number representation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
linear-time computational complexity | |||
Property / zbMATH Keywords: linear-time computational complexity / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: Fast, linear time hierarchical clustering using the Baire metric / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hierarchical trees can be perfectly scaled in one dimension / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Seriation and matrix reordering methods: An historical overview / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Least squares quantization in PCM / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetry in data mining and analysis: a unifying view based on hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.ENDM.2016.11.006 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:52, 9 December 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