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

DOI10.1134/S2070046612010062OpenAlexW2046149102MaRDI QIDQ1760308

Fionn Murtagh, Pedro Contreras

Publication date: 13 November 2012

Published in: \(p\)-Adic Numbers, Ultrametric Analysis, and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.6254

zbMATH Keywords

algorithmcomputational complexityclusteringmetricdata analysissearchstorageretrievalultrametric

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probability measures on topological spaces (60B05) Pattern recognition, speech recognition (68T10)

Related Items (4)

Variational inference for high dimensional structured factor copulas ⋮ 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 ⋮ Ultrametricity in the theory of complex systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast, linear time hierarchical clustering using the Baire metric
• On ultrametricity, data coding, and computation
• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• Segmentation of images in \(p\)-adic and Euclidean metrics.
• On \(p\)-adic classification
• Expected-time complexity results for hierarchic clustering algorithms which use cluster centres
• Applied algebraic dynamics
• Extensions of Lipschitz mappings into a Hilbert space
• Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
• An Order Theoretic Model for Cluster Analysis
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Geometric Representation of High Dimension, Low Sample Size Data
• Locality-sensitive hashing scheme based on p-stable distributions
• Data Clustering: Theory, Algorithms, and Applications

This page was built for publication: 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