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 Analysis, and Applications

Volumn 4, Issue 1, 2012, Pages 46-56

  Murtagh, F ^a,b   Contreras, P ^b  

^a SCIENCE FOUNDATION IRELAND   (Ireland)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

algorithm; clustering; computational complexity; data analysis; metric; retrieval; search; storage; ultrametric

Indexed keywords

EID: 84966728646     PISSN: 20700466     EISSN: 20700474     Source Type: Journal    
DOI: 10.1134/S2070046612010062     Document Type: Article

References (45)

1. A. C. M. van Rooij, Non-Archimedean Functional Analysis (Marcel Dekker, 1978).
2. F. Murtagh, “Multidimensional clustering algorithms,” Physica-Verlag (1985).
3. F. Murtagh, “On ultrametricity, data coding, and computation,” J. Classification 21, 167–184 (2004).
4. V. Anashin and A. Khrennikov, Applied Algebraic Dynamics (De Gruyter, 2009).
5. I. C. Lerman, Classification et Analyse Ordinale des Données(Dunod, Paris, 1981).
6. J. P. Benzécri, La Taxinomie (Dunod, Paris, 1979).
7. P. E. Bradley, “Mumford dendrograms,” J. Classification 53, 393–404 (2010).
8. B. Mirkin and P. Fishburn, Group Choice (V. H.Winston, 1979).
9. F. Murtagh, G. Downs and P. Contreras, “Hierarchical clustering of massive, high dimensional data sets by exploiting ultrametric embedding,” SIAM J. Sci. Computing 30(2), 707–730 (2008).
10. J. Benois-Pineau, A. Yu. Khrennikov and N. V. Kotovich, “Segmentation of images in p-adic and Euclidean metrics,” Dokl. Math. 64, 450–455 (2001).
11. P. E. Bradley, “On p-adic classification,“ p-Adic Numb. Ultr. Anal. Appl. 1, 271–285 (2009).
12. E. Bingham and H. Mannila, “Random projection in dimensionality reduction: applications to image and text data,” Proc. Seventh Int. Conf. on Knowledge Discovery and Data Mining, 245–250 (ACM, New York, NY, 2001).
13. S. Dasgupta, “Experiments with random projection,” Proc. 16th Conf. on Uncertainty in Artificial Intelligence, 143–151 (Morgan Kaufmann Publ., San Francisco, CA, 2000).
14. S. Deegalla and H. Boström, “Reducing high-dimensional data by principal component analysis vs. random projection for nearest neighbor classification,” ICMLA’ 06, Proc. 5th Int. Conf. on Machine Learning and Applications, 245–250 (IEEE Comp. Society, Washington, DC, 2006).
15. Xiaoli Zhang Fern and C. Brodly, “Random projection for high dimensional data clustering: a cluster ensemble approach,” Proc. Twentieth Int. Conf. on Machine Learning, (AAAI Press, Washington, DC, 2007).
16. D. Fradkin and D. Madigan, “Experiments with random projections formachine learning,” KDD 2003, Proc. Ninth ACM SIGKDD Int. Conf. on Knowledge Discovery and DataMining, 517–522 (ACM, New York, NY, 2003).
17. P. Li, T. Hastie and K. Church, “Very sparse random projections,” KDD 2006, Proc. 12th ACMSIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 1, 287–296 (ACM, New York, NY, 2006).
18. J. Lin and D. Gunopulos, “Dimensionality reduction by random projection and latent semantic indexing,” 3rd SIAM Int. Conf. on Data Mining (San Francisco, CA, March 2003).
19. S. S. Vempala, The Random ProjectionMethod, DIMACS: Series in Discrete Math. and Theor. Computer Science, American Math. Society 65, (2004); ISBN 0821820184.
20. W. B. Johnson and J. Lindenstrauss, “Extensions of Lipschitz maps into a Hilbert space,” Contemp. Math. 26, 189–20 (1984).
21. S. Dasgupta and A. Gupta, “An elementary proof of a theorem of Johnson and Lindenstrauss,” Random Struct. & Algorithms 22(1), 60–65, (JohnWiley & Sons, Inc., New York, 2003).
22. P. Frankl and H. Maehara, “The Johnson-Lindenstrauss lemma and the sphericity of some graphs,” J. Combin. Theory B 44(3), 355–362 (Acad. Press, Inc., Orlando, FL, 1988).
23. D. Achlioptas, “Database-friendly random projections,” PODS’ 01, Proc. Twentieth ACM SIGMODSIGACT-SIGART Symposium on Principles of Database Systems, 274–281 (ACM, New York, 2001).
24. P. Contreras, Search and Retrieval in Massive Data Collections, PhD (Royal Holloway, Univ. of London, 2010).
25. P. Contreras and F. Murtagh, “Fast, linear time hierarchical clustering using the Baire metric,” J. Classification, (2011), in press.
26. D. Dutta, R. Guha, P. C. Jurs and Ting Chen, “Scalable partitioning and exploration of chemical spaces using geometric hashing,” J. Chemical Inform. Modeling 46(1), 321–33 (Amer. Chemical Soc., 2006).
27. M. L. Miller, M. Acevedo Rodriguez and I. J. Cox, “Audio fingerprinting: nearest neighbor search in high dimensional binary spaces,” J. VLSI Signal Proc. Systems 41(3), 285–291 (Kluwer Acad. Publ., Hingham, MA, 2005).
28. R. Buaba, A. Homaifar, M. Gebril, E. Kihn and M. Zhizhin, “Satellite image retrieval using low memory locality sensitive hashing in Euclidean space,” Earth Sci. Informatics 4, 17–28 (2011).
29. Pengcheng Wu, S. C.H. Hoi, Nguyen Duc Dung and He Ying, “Randomly projected KD-trees with distance metric learning for image retrieval,” Int. Conf. onMultimediaModeling (MMM2011) (Taipei, Taiwan, 2011).
30. P. Indyk, A. Andoni, M. Datar, N. Immorlica and V. Mirrokni, “Locally-sensitive hashing using stable distributions,” Ed. by T. Darrell and P. Indyk and G. Shakhnarovich, Nearest Neighbor Methods in Learning and Vision: Theory and Practice (MIT Press, 2006).
31. P. Indyk, “Stable distributions, pseudorandom generators, embeddings and data stream computation,” Found. Computer Science FOCS 2000, 189–197 (Redondo Beach, CA, 2000).
32. P. Hall, J. S. Marron and A. Neeman, “Geometric representation of high dimension, low sample size data,” J. Royal Stat. Society B 67, 427–444 (2005).
33. Ping Li, T. J. Hastie and K. W. Church, “Very sparse random projections,” KDD’06 Proc. of the 12th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 287–296 (ACM, New York, 2006).
34. F. Murtagh, Correspondence Analysis and Data Coding with Java and R (Chapman & Hall/CRC, 2005); ISBN 1584885289.
35. R. Rammal, G. Toulouse and M. A. Virasoro, “Ultrametricity for physicists,” Rev. Mod. Phys. 58(3), 765–788 (Amer. Phys. Soc., 1986).
36. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order(Cambridge Univ. Press, 2002).
37. A. K. Seda and P. Hitzler, “Generalized distance functions in the theory of computation,” Computer J. 53, 443–464 (2010).
38. M. F. Janowitz, “An order theoretic model for cluster analysis,” SIAM J. Appl. Math. 34, 55–72 (1978).
39. M. F. Janowitz, “Cluster analysis based on abstract posets, preprint and presentations,” (2005); http://lacim.uqam.ca/sfc05/Articles/Janowitz.pdf.
40. F. Murtagh, “Expected time complexity results for hierarchic clustering algorithms that use cluster centers,” Information Proc. Lett. 16, 237–241 (1983).
41. P. Grabusts and A. Borisov, “Using grid-clustering methods in data classification,” PARELEC’ 02, Proc. Int. Conf. on Parallel Computing in Electrical Engineering, pages 425 (IEEE Computer Soc., Washington, DC, 2002).
42. Jae-Woo Chang and Du-Seok Jin, “A new cell-based clustering method for large, high-dimensional data in data mining applications,” SAC’ 02, Proc. 2002 ACM Symposium on Applied Computing, 503–507 (ACM, New York, 2002).
43. Guojun Gan, Chaoqun Ma and Jianhong Wu, Data Clustering Theory, Algorithms, and Applications (Soc. Indust. Appl. Math., SIAM, 2007); ISBN 9780898716238.
44. Nam Hun Park and Won Suk Lee, “Statistical grid-based clustering over data streams,” SIGMOD Record 33(1), 32–37 (ACM, New York, 2004).
45. Rui Xu and D. C. Wunsch, Clustering (IEEE Comp. Soc. Press, 2008).