Curse of dimensionality in pivot-based indexes

2009 2nd International Workshop on Similarity Search and Applications, SISAP 2009

Volumn , Issue , 2009, Pages 39-46

  Volnyansky, Ilya ^a   Pestov, Vladimir ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Concentration of measure; Curse of dimensionality; Data structures; Similarity search

Indexed keywords

ASYMPTOTIC PERFORMANCE; ASYMPTOTICALLY LINEAR; CONCENTRATION OF MEASURE; COST MODELS; CURSE OF DIMENSIONALITY; DATA SETS; DISTANCE CALCULATION; HIGH DIMENSIONS; INDEXING SCHEME; INTRINSIC DIMENSIONS; METRIC SPACES; SIMILARITY SEARCH; SINGLE COMPUTATION; STATISTICAL LEARNING; SUBLINEAR;

ASYMPTOTIC ANALYSIS; DATA STRUCTURES; SET THEORY; TOPOLOGY;

INDEXING (OF INFORMATION);

EID: 70449893820     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SISAP.2009.9     Document Type: Conference Paper

References (25)

1. [Ash71] Ash, R.B. (1971) Complex Variables. Academic Press.
2. [Bey99] Beyer, K, Goldstein, J., Ramakrishnan, R., Shaft, U. (1999) When is "Nearest Neighbour" meaningful? Lect. Notes in Comp. Sci., vol. 1540, 217-235
3. [Blu89] Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K. (1989) Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36, 929-965.
4. [Bus03] Bustos, B., Chávez, E., Navarro, G (2003) Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters, 24-14, 2357-2366.
5. [Cia97] Ciaccia, P., Patella, M., Zezula, P. (1997) M-tree: An efficient access method for similarity search in metric spaces. Proc. VLDB 1997: pp426-435
6. [Cia98] Ciaccia, P., Patella, M., Zezula, P. (1998) A cost model for similarity queries in metric spaces. Proc. 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.
7. [Cha01] Chávez, E., Navarro, G. Baeza-Yates, R. & Marroquín, J. L. (2001). Searching in metric spaces. ACM Computing Surveys, 33, 273-321.
8. [Cha01b] Chávez, E., Navarro, G. (2001). Towards measuring the searching complexity of metric spaces. Proceedings of ENC'01, 969-978.
9. [Cha05] Chávez, E., Navarro, G. (2005). A compact space decomposition for effective metric indexing. Pattern Recognition Letters, v.26, issue 9, pp 1363-1376
10. [Cla05] Clarkson, K.L. (2005) Nearest-Neighbor Searching and Metric Space Dimensions. Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, MIT Press, 2006.
11. [Dev97] Devroye, L., Györfi, L., Lugosi, G. (1997) A Probabilistic Theory of Pattern Recognition. Springer
12. [Dud84] Dudley, R.M. (1984). A Course on Empirical Processes, Lecture Notes in Math. Springer, New York, 1984
13. [Gro83] Gromov, M., Milman, V.D. (1983). A topological application of the isoperimetric inequality. Amer. J. Math. 105, 843-854.
14. [Heg01] Hegland, M. (2001) Data mining techniques. Acta Numerica, 2001 pp313-355
15. [Ind04] Indyk, P. (2004). Ch. 39 of Handbook of Discrete and Computational Geometry, Goodman, J.E., O'Rourke, J., eds., CRC Press.
16. [Kle97] Kleinberg, J. (1997) Two algorithms for nearest-neighbor search in high dimensions. Proc. 29th ACM Symposium on Theory of Computing.
17. [Men03] Mendelson, S. (2003) A few notes on statistical learning theory. Advanced Lectures in Machine Learning LNCS 2600, 1-40. Springer
18. [Mil86] Milman, V.D., Schechtman, G. (1986) Asymptotic theory of finite dimensional normed spaces. Lecture Notes in Mathematics.
19. [Pes00] Pestov, V. (2000). On the geometry of similarity search: dimensionality curse and concentration of measure. Inform. Process. Lett. 73, 47-51.
20. [Pes08] Pestov, V. (2008). An axiomatic approach to intrinsic dimension of a dataset. Neural Networks 21, 204-213.
21. [Sha06] Shaft, U., Ramakrishnan, R. (2006) Theory of nearest neighbors indexability . ACM Transactions on Database Systems, Volume 31 , Issue 3, pp 814-838.
22. [Vap98] Vapnik, V. (1998) Statistical Learning Theory. Wiley series on adaptive and learning systems for signal processing, communications and control.
23. [Vid03] Vidyasagar, M. (2003) Learning and Generalisation: With Applications to Neural Networks. Springer.
24. [Web98] Weber, R., Schek, Hans-J., Blott, S. (1998) A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces Proceedings of the 24rd International Conference on Very Large Data Bases, pp194-205.
25. [Zez05] Zezula, P., Amato, G., Dohnal, V., Batko, M. (2005) Similarity search: the metric space approach. Springer series: advances in database systems, vol 32.