Fast, linear time hierarchical clustering using the Baire metric
From MaRDI portal
Publication:263340
DOI10.1007/s00357-012-9106-3zbMath1360.62322arXiv1106.2229OpenAlexW3102052320MaRDI QIDQ263340
Fionn Murtagh, Pedro Contreras
Publication date: 4 April 2016
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.2229
Related Items (8)
Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics ⋮ Ultrametric diffusion equation on energy landscape to model disease spread in hierarchic socially clustered population ⋮ Versatile linkage: a family of space-conserving strategies for agglomerative hierarchical clustering ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ Direct reading algorithm for hierarchical clustering ⋮ 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 ⋮ Ultrametricity of Dissimilarity Spaces and Its Significance for Data Mining ⋮ Thinking Ultrametrically, Thinking p-Adically
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Degenerating families of dendrograms
- On ultrametricity, data coding, and computation
- Symmetry in data mining and analysis: a unifying view based on hierarchy
- Hierarchical clustering schemes
- Ordinal and Relational Clustering
- Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
- An Order Theoretic Model for Cluster Analysis
- Thinking Ultrametrically, Thinking p-Adically
This page was built for publication: Fast, linear time hierarchical clustering using the Baire metric
