Sparse p-adic data coding for computationally efficient and effective big data analytics
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 hierar- chy 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, effi cient storage results, and for bounded p-adic norm stored data, search and retrieval are constant time operations. Examples show the e ffectiveness of this new approach to content-driven encoding and displaying of data.Citation
Murtagh, F. 'Sparse p-adic data coding for computationally efficient and effective big data analytics' 2016, 8 (3):236 P-Adic Numbers, Ultrametric Analysis, and ApplicationsPublisher
Pleiades Publishing Ltd. (Springer)Journal
P-Adic Numbers, Ultrametric Analysis, and ApplicationsDOI
10.1134/S2070046616030055Additional Links
http://link.springer.com/10.1134/S2070046616030055https://arxiv.org/pdf/1604.06961v1.pdf
Type
ArticleLanguage
enISSN
2070-04662070-0474
ae974a485f413a2113503eed53cd6c53
10.1134/S2070046616030055
Scopus Count
Collections
The following license files are associated with this item:
- Creative Commons
Except where otherwise noted, this item's license is described as Archived with thanks to P-Adic Numbers, Ultrametric Analysis, and Applications