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

DOI10.1134/S2070046616030055MaRDI QIDQ344041zbMATH OpenFDO

Authors F. 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

big datahierarchical clustering\(p\)-adic numbersbinary rooted treecomputational and storage complexityultrametric topology

Mathematics Subject Classification ID

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

Abstract: We develop the theory and practical implementation of p-adic sparse coding of data. Rather than the standard, sparsifying criterion that uses the $L_0$ pseudo-norm, we use the p-adic norm. We require that the hierarchy or tree be node-ranked, as is standard practice in agglomerative and other hierarchical clustering, but not necessarily with decision trees. In order to structure the data, all computational processing operations are direct reading of the data, or are bounded by a constant number of direct readings of the data, implying linear computational time. Through p-adic sparse data coding, efficient storage results, and for bounded p-adic norm stored data, search and retrieval are constant time operations. Examples show the effectiveness of this new approach to content-driven encoding and displaying of data.

Recommendations

• \(p\)-adic arithmetic coding
• On \(p\)-adic classification
• Thinking ultrametrically, thinking \(p\)-adically
• From image processing to topological modelling with \(p\)-adic numbers
• Representation and compression of images with the aid of m-adic coordinate systems

Cites work

• scientific article; zbMATH DE number 3880972 (Why is no real title available?)
• scientific article; zbMATH DE number 1113989 (Why is no real title available?)
• scientific article; zbMATH DE number 1974595 (Why is no real title available?)
• scientific article; zbMATH DE number 3099606 (Why is no real title available?)
• A statistical derivation of the significant-digit law
• An introduction to Benford's law
• Fast, linear time hierarchical clustering using the Baire metric
• 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
• From data to the \(p\)-adic or ultrametric model
• Gene expression from 2-adic dynamical systems
• Geometric Representation of High Dimension, Low Sample Size Data
• Model-Based Compressive Sensing
• On \(p\)-adic classification
• Symmetry in data mining and analysis: a unifying view based on hierarchy
• The \(p\)-adic sector of the adelic string
• \(p\)-adic arithmetic coding
• \(p\)-adic numbers. An introduction

Cited in

(4)

• \(p\)-adic mathematical physics: the first 30 years
• scientific article; zbMATH DE number 6765491 (Why is no real title available?)
• On \(p\)-adic classification
• \(p\)-adic arithmetic coding

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

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