Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics

DOI10.1134/S2070046616030055zbMath1353.94026arXiv1604.06961MaRDI QIDQ344041

Fionn Murtagh

Publication date: 22 November 2016

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

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

zbMATH Keywords

hierarchical clustering\(p\)-adic numbersbig databinary rooted treecomputational and storage complexityultrametric topology

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Source coding (94A29) Other nonanalytic theory (11S85)

Related Items (1)

\(p\)-adic mathematical physics: the first 30 years

Cites Work

• Fast, linear time hierarchical clustering using the Baire metric
• From data to the \(p\)-adic or ultrametric model
• Gene expression from 2-adic dynamical systems
• Symmetry in data mining and analysis: a unifying view based on hierarchy
• A statistical derivation of the significant-digit law
• On \(p\)-adic classification
• 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
• The \(p\)-adic sector of the adelic string
• An Introduction to Benford's Law
• Model-Based Compressive Sensing
• Geometric Representation of High Dimension, Low Sample Size Data
• \(p\)-adic numbers. An introduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sparse \(p\)-adic data coding for computationally efficient and effective big data analytics