Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces

Information Processing Letters

Volumn 85, Issue 1, 2003, Pages 39-46

  Chávez, Edgar ^a   Navarro, Gonzalo ^b  

^a UNIVERSIDAD MICHOACANA DE SAN NICOLÁS DE HIDALGO   (Mexico)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Approximation algorithms; Distance based indexing; Metric spaces; Nearest neighbor searching; Probabilistic algorithms; Proximity searching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; ERROR ANALYSIS; INDEXING (OF INFORMATION); ONLINE SEARCHING; PROBABILITY; VECTORS;

PROXIMITY SEARCHING;

COMPUTATIONAL GEOMETRY;

EID: 0037448286     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00344-7     Document Type: Article

References (15)

1. Arya S., Mount D. Approximate range searching. Proc. 11th Annual ACM Symposium on Computational Geometry. 1995;172-181.
2. Arya S., Mount D., Netanyahu N., Silverman R., Wu A. An optimal algorithm for approximate nearest neighbor searching in fixed dimension. Proc. SODA'94. 1994;573-583.
3. Baeza-Yates R., Cunto W., Manber U., Wu S. Proximity matching using fixed-queries trees. Proc. CPM'94. Lecture Notes in Comput. Sci. 807:1994;198-212.
4. Bentley J. Multidimensional binary search trees in database applications. IEEE Trans. Software Engrg. 5:(4):1979;333-340.
5. Chávez E., Marroquín J., Baeza-Yates R. Spaghettis: an array based algorithm for similarity queries in metric spaces. Proc. SPIRE'99. 1999;38-46 IEEE CS Press.
6. Chávez E., Marroquín J., Navarro G. Fixed queries array: a fast and economical data structure for proximity searching. Multimedia Tools Appl. 14:(2):2001;113-135.
7. E. Chávez, G. Navarro, R. Baeza-Yates, J. Marroquín, Searching in metric spaces, ACM Comput. Surv., to appear.
8. Chazelle B. Computational geometry: a retrospective. Proc. ACM STOC'94. 1994;75-94.
9. Clarkson K. Nearest neighbor queries in metric spaces. Discrete Comput. Geometry. 22:(1):1999;63-93.
10. Guttman A. R-trees: a dynamic index structure for spatial searching. Proc. ACM SIGMOD'84. 1984;47-57.
11. Harman D. Overview of the Third Text Retrieval Conference. Proc. TREC-3. 1995;1-19. NIST Special Publication 500-207.
12. Micó L., Oncina J., Carrasco R. A fast branch and bound nearest neighbour classifier in metric spaces. Pattern Recognition Lett. 17:1996;731-739.
13. Micó L., Oncina J., Vidal E. A new version of the nearest-neighbor approximating and eliminating search (aesa) with linear preprocessing-time and memory requirements. Pattern Recognition Lett. 15:1994;9-17.
14. White D., Jain R. Algorithms and strategies for similarity retrieval, Tech. Rep. VCL-96-101. 1996;Visual Comp. Lab., Univ. of California.
15. Yianilos P.N. Locally lifting the curse of dimensionality for nearest neighbor search, Tech. Rep. 1999;NEC Research Institute, Princeton, NJ.