Direct reading algorithm for hierarchical clustering

DOI10.1016/J.ENDM.2016.11.006MaRDI QIDQ509277zbMATH OpenOpenAlexFDO

Authors F. Murtagh, Pedro Contreras

Publication date 9 February 2017

Full work available at URL https://doi.org/10.1016/j.endm.2016.11.006

zbMATH Keywords

\(p\)-adic and \(m\)-adic number representationanalyticshierarchical clusteringlinear-time computational complexityultrametric topology

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Theory of data (68P99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
• Fast, linear time hierarchical clustering using the Baire metric
• Hierarchical clustering
• The remarkable simplicity of very high dimensional data: application of model-based clustering
• scientific article; zbMATH DE number 1124646

Cites work

• Fast, linear time hierarchical clustering using the Baire metric
• Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
• Hierarchical trees can be perfectly scaled in one dimension
• Least squares quantization in PCM
• Seriation and matrix reordering methods: An historical overview
• Symmetry in data mining and analysis: a unifying view based on hierarchy

Cited in

(4)

• Fast, linear time, m-adic hierarchical clustering for search and retrieval using the Baire metric, with linkages to generalized ultrametrics, hashing, formal concept analysis, and precision of data measurement
• Fast, linear time hierarchical clustering using the Baire metric
• A survey on feature weighting based K-means algorithms
• Eigenanalysis and metric multidimensional scaling on hierarchical structures

This page was built for publication: Direct reading algorithm for hierarchical clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509277)