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

DOI10.1134/S2070046616030055zbMATH Open1353.94026arXiv1604.06961MaRDI QIDQ344041FDOQ344041

Authors: F. Murtagh 

Publication date: 22 November 2016

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

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.

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

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

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)

Cites Work

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

Cited In (3)

• \(p\)-adic mathematical physics: the first 30 years
• Title not available (Why is that?)
• \(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)