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

P-Adic Numbers, Ultrametric Analysis, and Applications

Volumn 8, Issue 3, 2016, Pages 236-247

  Murtagh, F ^a,b  

^a UNIVERSITY OF DERBY   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

big data; binary rooted tree; computational and storage complexity; hierarchical clustering; p adic numbers; ultrametric topology

Indexed keywords

EID: 84981716488     PISSN: 20700466     EISSN: 20700474     Source Type: Journal    
DOI: 10.1134/S2070046616030055     Document Type: Article

References (32)

1. R. G. Baraniuk, V. Cevher, M. F. Duarte and C. Hegde, “Model-based compressive sensing,” IEEE Trans. Inf. Theory 56 (4), 1982–2001 (2010).
2. H.-H. Bock, “Origins and extensions of the k-means algorithm in cluster analysis,” E-Journ. Hist. Prob. Stat. 4 (2) (2008). http://wwwjehpsnet/Decembre2008/Bockpdf.
3. P. E. Bradley, “On p-adic classification,” p-Adic Numbers Ultrametric Anal. Appl. 1 (4), 271–285 (2009).
4. L. Brekke and P. G. O. Freund, “p-Adic numbers in physics”, Phys. Rep. 233, 1–66 (1993).
5. F. Benford, “The law of anomalous numbers,” Proc. Amer. Phil. Soc. 78, 551–572 (1938).
6. A. Berger and T. P. Hill, An Introduction to Benford’s Law (Princeton Univ. Press, 2015).
7. P. Contreras and F. Murtagh, “Fast, linear time hierarchical clustering using the Baire metric,” J. Class. 29, 118–143 (2012).
8. B. Dragovich and A. Dragovich, “p-Adic modelling of the genome and the genetic code,” Comp. J. 53, 432–42 (2010).
9. O. Erdem, A. Carus and Hoang Le, “Value-coded trie structure for high-performance IPv6 lookup,” Comp. J. 58 (2), 204–214 (2015).
10. F. Q. Gouvea, p-Adic Numbers (Springer, Berlin, 2003).
11. P. Hall, J. S. Marron and A. Neeman, “Geometric representation of high dimension, low sample size data,” J. Royal Stat. Soc. Ser. B 67, 427–444 (2005).
12. K. Hayashi, M. Nagahara and T. Tanaka, “A user’s guide to compressed sensing for communications systems,” IEICE Trans. Comm. E96-B (3), 685–712 (2013).
13. T. P. Hill, “A statistical derivation of the significant-digit law,” Stat. Sci. 10 (4), 354–363 (1995).
14. D. W. Jones, The Ternary Manifesto, including “Standard ternary logic,” “Ternary arithmetic,” “Ter- SCII: ternary standard code for information interchange,” “Number representations for ternary computers”. http://homepagecsuiowaedu/~jones/ternary (2012).
15. A. Yu. Khrennikov, “Gene expression from polynomial dynamics in the 2-adic information space,” Proc. Steklov Inst.Math. 265, 131–139 (2009).
16. M. Krasner, “Nombres semi-ré els et espaces ultramé triques,” Comptes-Rendus de l’Acadé mie des Sciences, Tome II, 219, 433–435 (1944).
17. Y. Linde, A. Buzo and R. M. Gray, “An algorithm for vector quantization design,” IEEE Trans. Comm. 28, 84–95 (1980).
18. B. Mirkin, “Linear embedding of binary hierarchies and its applications,” in B. Mirkin, F. McMorris, F. Roberts and A. Rzhetsky (Eds.) Mathematical Hierarchies and Biology, DIMACS Series Disc. Math. Theor. Comp. Sci. 37, 331–356 (Amer.Math. Soc., Providence, 1997).
19. B. Mirkin and E. Koonin, “A top-down method for building genome classification trees with linear binary hierarchies,” in M. Janowitz, J.-F. Lapointe, F. McMorris, B. Mirkin and F. Roberts (Eds.) Bioconsensus, DIMACS Ser. 61, 97–112 (Amer.Math. Soc., Providence, 2003).
20. F. Murtagh, “Symmetry in data mining and analysis: a unifying view based on hierarchy,” Proc. Steklov Inst. Math. 265, 177–198 (2009).
21. F. Murtagh, “From data to the p-adic or ultrametic model,” p-Adic Numbers Ultrametric Anal. Appl. 1, 58–68 (2009).
22. F. Murtagh and P. Contreras, “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,” p-Adic Numbers Ultrametric Anal. Appl. 4, 45–56 (2012).
23. F. Murtagh, “MoreLikeThis and Scoring in Solr,” technical report, 4 pp., 26 May 2013. http://wwwmultiresolutionscom/HiClBaireRanSpanPaths
24. F. Murtagh and P. Contreras, “Linear storage and potentially constant time hierarchical clustering using the Baire metric and random spanning paths,” in A. F. X. Wilhelm and H. A. Kestler (Eds.), Analysis of Large and Complex Data (Springer, Heidelberg, 2016).
25. F. Murtagh and P. Contreras, “Clustering through high dimensional data scaling: applications and implementations,” Proceedings, ECDA 2015, European Conf. on Data Analysis, forthcoming (2016).
26. F. Murtagh, “Big Data scaling through metric mapping: Exploiting the remarkable simplicity of very high dimensional spaces using Correspondence Analysis,” Proceedings, IFCS 2015, Int. Fed. Class. Soc., forthcoming (2016).
27. F. Murtagh and P. Contreras, “Random projection towards the Baire metric for high dimensional clustering,” in A. Gammerman, V. Vovk and H. Papadopoulos, (Eds.) Statistical Learning and Data Sciences, Lect. Notes Art. Intell. 9047, 424–431 (Springer, Heidelberg, 2015).
28. A. Ng et al., “Sparse coding,” ufldlstanfordedu/wiki/indexphp/Sparse_Coding, last modified 8 April 2013 (accessed 2016-04-08).
29. A. Rodionov and S. Volkov, “p-Adic arithmetic coding,” Cont. Math. 508, 201–213 (2010).
30. A. Rodionov and S. Volkov, “p-Adic arithmetic coding,” 29 pp. (2007), http://arxivorg/abs/0704.0834v1.
31. W. H. Schikhof, Ultrametric Calculus, (Chapters 18, 19, 20, 21) (Cambridge Univ. Press, Cambridge, UK, 1984).
32. H. A. Simon, The Sciences of the Artificial, 3rd edn. (MIT Press, 1996).