Thinking Ultrametrically, Thinking p-Adically

DOI10.1007/978-1-4939-0742-7_16zbMath1365.68232OpenAlexW1596648627MaRDI QIDQ5270628

Fionn Murtagh

Publication date: 26 June 2017

Published in: Clusters, Orders, and Trees: Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4939-0742-7_16

zbMATH Keywords

complexitypattern recognitionclusteringmultivariate data analysishierarchy\(p\)-adicdata analyticsultrametric topologyinformation storage and retrieval

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Metric spaces, metrizability (54E35) Pattern recognition, speech recognition (68T10) Miscellaneous applications of number theory (11Z05) Information storage and retrieval of data (68P20)

Related Items

Introduction: Advancing Non-Archimedean Mathematics ⋮ Introduction: Nature and Its Mathematics ⋮ Archimedean and Non-Archimedean Approaches to Mathematical Modeling ⋮ Degenerating families of dendrograms ⋮ Fast, linear time hierarchical clustering using the Baire metric

Cites Work

• The remarkable simplicity of very high dimensional data: application of model-based clustering
• Fast, linear time hierarchical clustering using the Baire metric
• Gene expression from polynomial dynamics in the 2-adic information space
• Hierarchical trees can be perfectly scaled in one dimension
• Counting dendrograms: A survey
• On ultrametricity, data coding, and computation
• On \(p\)-adic mathematical physics
• Symmetry in data mining and analysis: a unifying view based on hierarchy
• \(p\)-adic numbers: An introduction.
• Number theory as the ultimate physical theory
• Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
• A wavelet theory for local fields and related groups
• Hierarchical clustering schemes
• The \(p\)-adic sector of the adelic string
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• The Haar wavelet transform of a dendrogram
• Mathematical classification and clustering
• Mathematics and Complex Systems
• Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
• Espaces ultramétriques
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• An Order Theoretic Model for Cluster Analysis
• Pivot selection techniques for proximity searching in metric spaces
• Two-mode clustering methods: astructuredoverview
• Cluster Analysis Based on Posets
• Geometric Representation of High Dimension, Low Sample Size Data
• Neighborliness of randomly projected simplices in high dimensions
• The Geometry of Information Retrieval
• On Ultrametricity and a Symmetry Between Bose-Einstein and Fermi-Dirac Systems
• p-Adic Strings and Their Applications
• An Ordering Algorithm for Analysis of Data Arrays
• Problem Decomposition and Data Reorganization by a Clustering Technique
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item