Indexability, concentration, and VC theory

Journal of Discrete Algorithms

Volumn 13, Issue , 2012, Pages 2-18

  Pestov, Vladimir ^a,b  

^a FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Concentration of measure; Curse of dimensionality; Exact similarity search; Indexing schemes; Lipschitz functions; Metric trees; Pivot tables; Uniform Glivenko Cantelli theorem

Indexed keywords

CONCENTRATION OF MEASURE; CURSE OF DIMENSIONALITY; INDEXING SCHEME; LIPSCHITZ FUNCTIONS; METRIC TREES; PIVOT-TABLES; SIMILARITY SEARCH; UNIFORM GLIVENKO-CANTELLI THEOREM;

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS;

INDEXING (OF INFORMATION);

EID: 84859786845     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2011.10.002     Document Type: Conference Paper

References (58)

1. A. Andoni, P. Indyk, M. Pǎtrascu, On the optimality of the dimensionality reduction method, in: Proc. 47th IEEE Symp. on Foundations of Computer Science, 2006, pp. 449-458. (Pubitemid 351175533)
2. M. Anthony, and P. Bartlett Neural Network Learning: Theoretical Foundations 1999 Cambridge University Press Cambridge
3. O. Barkol, Y. Rabani, Tighter lower bounds for nearest neighbor search and related problems in the cell probe model, in: Proc. 32nd ACM Symp. on the Theory of Computing, 2000, pp. 388-396.
4. A. Borodin, R. Ostrovsky, Y. Rabani, Lower bounds for high-dimensional nearest neighbor search and related problems, in: Proc. 31st Annual ACS Sympos. Theory Comput., 1999, pp. 312-321.
5. B. Bustos, G. Navarro, and E. Chávez Pivot selection techniques for proximity searching in metric spaces Pattern Recogn. Lett. 24 2003 2357 2366 (Pubitemid 36911079)
6. J.-P. Changeux, and A. Connes Conversations on Mind, Matter, and Mathematics Dec. 1998 Princeton University Press
7. E. Chávez, J.L. Marroquín, R.A. Baeza-Yates, Spaghettis: An array based algorithm for similarity queries in metric spaces, in: Proceedings SPIRE/CRIWG, 1999, pp. 38-46.
8. E. Chávez, G. Navarro, R. Baeza-Yates, and J.L. Marroquín Searching in metric spaces ACM Comput. Surv. 33 2001 273 321 (Pubitemid 33768485)
9. P. Ciaccia, M. Patella, P. Zezula, M-tree: An efficient access method for similarity search in metric spaces, in: Proceedings of 23rd International Conference on Very Large Data Bases (VLDB97), Athens, Greece, 1997, pp. 426-435.
10. P. Ciaccia, M. Patella, P. Zezula, A cost model for similarity queries in metric spaces, in: Proc. 17th ACM Symposium on Principles of Database Systems (PODS98), Seattle, WA, 1998, pp. 59-68.
11. K.L. Clarkson, An algorithm for approximate closest-point queries, in: Proc. 10th Symp. Comp. Geom. Stony Brook, NY, 1994, pp. 160-164.
12. K.L. Clarkson Nearest-neighbor searching and metric space dimensions Nearest-Neighbor Methods for Learning and Vision: Theory and Practice 2006 MIT Press 15 59
13. W.J. Davis Remarks on finite rank projections J. Approx. Theory 9 1973 205 211
14. L. Devroye, L. Györfi, and G. Lugosi A Probabilistic Theory of Pattern Recognition 1996 Springer-Verlag New York
15. A. Faragó, T. Linder, and G. Lugosi Fast nearest neighbor search in dissimilarity spaces IEEE Trans. Pattern Anal. Machine Intell. 18 1993 957 962 (Pubitemid 23703599)
16. P. Frankls, and Z. Füredi A short proof for a theorem of Harper about Hamming-spheres Discrete Math. 34 1981 311 313
17. A.A. Giannopoulos, and V.D. Milman Euclidean structure in finite dimensional normed spaces Handbook of the Geometry of Banach Spaces, vol. 1 2001 North-Holland Amsterdam 707 779
18. P.W. Goldberg, and M.R. Jerrum Bounding the Vapnik-Chervonenkis dimension of concept classes parametrized by real numbers Machine Learning 18 1995 131 148
19. M. Gromov Metric Structures for Riemannian and Non-Riemannian Spaces Progress in Mathematics vol. 152 1999 Birkhauser Verlag
20. M. Gromov, and V.D. Milman A topological application of the isoperimetric inequality Amer. J. Math. 105 1983 843 854
21. P. Hall, J.S. Marron, and A. Neeman Geometric representation of high dimension, low sample size data J. R. Stat. Soc. Ser. B Stat. Methodol. 67 2005 427 444 (Pubitemid 40855293)
22. P. Indyk Nearest neighbours in high-dimensional spaces J.E. Goodman, J. ORourke, Handbook of Discrete and Computational Geometry 2004 Chapman and Hall/CRC Boca Raton-London-New York-Washington, D.C. 877 892
23. P. Indyk, R. Motwani, Approximate nearest neighbours: towards removing the curse of dimensionality, in: Proc. 30th ACM Symp. Theory of Computing, 1998, pp. 604-613.
24. W.B. Johnson, and J. Lindenstrauss Extensions of Lipschitz mappings into a Hilbert space Contemp. Math. 26 1984 189 206
25. W.B. Johnson, and J. Lindenstrauss Basic concepts in the geometry of Banach spaces Handbook of the Geometry of Banach Spaces, vol. 1 2001 North-Holland Amsterdam 1 84
26. B. Klartag A central limit theorem for convex sets Invent. Math. 168 2007 91 131
27. R. Krauthgamer, and J.R. Lee The black-box complexity of nearest-neighbor search Theoret. Comput. Sci. 348 2 December 2005 262 276
28. E. Kushilevitz, R. Ostrovsky, and Y. Rabani Efficient search for approximate nearest neighbor in high-dimensional spaces SIAM J. Comput. 30 2000 457 474
29. M. Ledoux The Concentration of Measure Phenomenon Mathematical Surveys and Monographs vol. 89 2001 Amer. Math. Soc.
30. J. Matoušek Lectures on Discrete Geometry 2002 Springer New York
31. J. Matoušek On variants of the Johnson-Lindenstrauss lemma Random Structures Algorithms 33 2008 142 156
32. J. Melleray On the geometry of Urysohns universal metric space Topology Appl. 154 2007 384 403 (Pubitemid 44783051)
33. V. Milman Topics in asymptotic geometric analysis Geometric and Functional Analysis (special volume GAFA2000) 2000 792 815 (Pubitemid 33261284)
34. V.D. Milman, and G. Schechtman Asymptotic Theory of Finite-Dimensional Normed Spaces (with an Appendix by M. Gromov) Lecture Notes in Math. vol. 1200 1986 Springer
35. P.B. Miltersen, Cell probe complexity - a survey, in: Advances in Data Structures Workshop, 19th Conf. on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 1999.
36. G. Navarro Searching in metric spaces by spatial approximation VLDB J. 11 2002 28 46 (Pubitemid 36156213)
37. G. Navarro, Analysing metric space indexes: what for? Invited paper, in: Proc. 2nd Int. Workshop on Similarity Search and Applications (SISAP 2009), Prague, Czech Republic, 2009, pp. 3-10.
38. Yann Ollivier Ricci curvature of metric spaces C. R. Math. Acad. Sci. Paris 345 2007 643 646
39. M. Patella, P. Ciaccia, The many facets of approximate similarity search. Invited paper, in: Proc. First Int. Workshop on Similarity Search and Applications (SISAP 2008), Cancun, México, 2008, pp. 10-21. (Pubitemid 351720756)
40. M. Pǎtrascu, M. Thorup, Higher lower bounds for near-neighbor and further rich problems, in: Proc. 47th IEEE Symp. on Foundations of Computer Science, 2006, pp. 646-654.
41. V. Pestov On the geometry of similarity search: dimensionality curse and concentration of measure Inform. Process. Lett. 73 2000 47 51 (Pubitemid 30563374)
42. V. Pestov, Intrinsic dimension of a dataset: what properties does one expect? in: Proc. of the 22nd Int. Joint Conf. on Neural Networks (IJCNN07), Orlando, FL., 2007, pp. 1775-1780.
43. V. Pestov An axiomatic approach to intrinsic dimension of a dataset Neural Networks 21 2008 204 213
44. V. Pestov Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions Alfredo Ferro, Proceedings of the 4th International Conference on Similarity Search and Applications (SISAP 2011) 30 June-1 July 2011, Lipari, Sicily, Italy 2011 ACM New York, NY 25 32
45. V. Pestov, and A. Stojmirović Indexing schemes for similarity search: an illustrated paradigm Fund. Inform. 70 2006 367 385 (Pubitemid 43760897)
46. H. Samet Foundations of Multidimensional and Metric Data Structures 2005 Morgan Kaufmann Publishers Inc. San Francisco, CA
47. U. Shaft, and R. Ramakrishnan Theory of nearest neighbors indexability ACM Trans. Database Systems (TODS) 31 2006 814 838 (Pubitemid 44600827)
48. SISAP metric space library http://sisap.org/Metric-Space-Library.html
49. A. Stojmirović, and V. Pestov Indexing schemes for similarity search in datasets of short protein fragments Inform. Systems 32 2007 1145 1165 (Pubitemid 47379494)
50. K. Taşdemir, and E. Merényi Exploiting the data topology in visualizing and clustering of self-organizing maps IEEE Trans. Neural Networks 20 4 2009 549 562
51. J. Väisälä Gromov hyperbolic spaces Expo. Math. 23 2005 187 231 (Pubitemid 41259014)
52. V.N. Vapnik Statistical Learning Theory 1998 John Wiley & Sons, Inc. New York
53. S.S. Vempala The Random Projection Method DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 65 2004 Amer. Math. Soc. Providence, RI
54. A.M. Vershik Universality and randomness for the graphs and metric spaces Frontiers in Number Theory, Physics, and Geometry. I 2006 Springer Berlin 245 266
55. E. Vidal An algorithm for finding nearest neighbors in (approximately) constant average time Pattern Recogn. Lett. 4 1986 145 157
56. M. Vidyasagar Learning and Generalization, with Applications to Neural Networks second ed. 2003 Springer-Verlag London
57. I. Volnyansky, V. Pestov, Curse of dimensionality in pivot-based indexes, in: Proc. 2nd Int. Workshop on Similarity Search and Applications (SISAP 2009), Prague, Czech Republic, 2009, pp. 39-46.
58. P. Zezula, G. Amato, V. Dohnal, and M. Batko Similarity Search. The Metric Space Approach 2006 Springer Science + Business Media New York