Direct reading algorithm for hierarchical clustering (Q509277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2016.11.006 / 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

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
    0 references
    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

    Identifiers