Proximity searching in high dimensional spaces with a proximity preserving order

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3789 LNAI, Issue , 2005, Pages 405-414

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

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

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); DATABASE SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES; SEARCH ENGINES;

CLUSTERED DATA; PROBABILISTIC PROXIMITY; PROXIMITY PRESERVING ORDER; PROXIMITY SEARCH ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 33646822090     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11579427_41     Document Type: Conference Paper

References (18)

1. S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimension, In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA'94), pages 573-583, 1994.
2. S. Brin, Near neighbor search In large metric spaces. In Proc. 21st Conference on Very Large Databases (VLDB'95), pages 574-584, 1995.
3. B. Bustos and G. Navarro. Probabilistic proximity search algorithms based on compact partitions. Journal of Discrete Algorithms (JDA), 2(1):115-134, 2003.
4. E. Chávez and K. Figueroa. Faster proximity searching in metric data. In Proc. of the Mexican International Conference in Artificial Intelligence (MICAI), Lecture Notes in Computer Science, pages 222-231, Springer, 2004.
5. E. Chávez, J.L. Marroquin, and G. Navarro. Fixed queries array: A fast and economical data structure for proximity searching. Multimedia Tools and Applications (MTAP), 14(2):113-135, 2001.
6. E. Chávez and G. Navarro. Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. Inf. Process. Lett., 85(1):39-46, 2003.
7. E. Chávez and G. Navarro. A compact space decomposition for effective metric indexing. Pattern Recognition Letters, 26(9):1363-1376, 2005.
8. E. Chávez, G. Navarro, R. Baeza-Yates, and J.L. Marroquin. Proximity searching in metric spaces. ACM Computing Surveys, 33(3):273-321, 2001.
9. P. Ciaccia and M. Patella. Pac nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In Proc. 16th Intl. Conf. on Data Engineering (ICDE'00), pages 244-255. IEEE Computer Society, 2000.
10. P. Ciaccia, M. Patella, and P. Zezula. M-tree: an efficient access method for similarity search in metric spaces. In Proc. of the 23rd Conference on Very Large Databases (VLDB'97), pages 426-435, 1997.
11. K. Clarkson. Nearest neighbor queries in metric spaces. Discrete Computational Geometry, 22(1):63-93, 1999.
12. R. Fagin, R. Kumar, and D. Sivakumar. Comparing top k lists. SIAM J. Discrete Math., 17(1):134-160, 2003.
13. G. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. ACM Trans. Database Syst., 28(4):517-580, 2003.
14. G. Navarro. Searching in metric spaces by spatial approximation. The Very Large Databases Journal (VLDBJ), 11(1):28-46, 2002.
15. E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters, 4:145-157, 1986.
16. D. White and R. Jain. Algorithms and strategies for similarity retrieval. Technical Report VCL-96-101, Visual Computing Laboratory, University of California, La Jolla, California, July 1996.
17. P. Yianilos. Excluded middle vantage point forests for nearest neighbor search. In DIMACS Implementation Challenge, ALENEX'99, Baltimore, MD, 1999.
18. P. N. Yianilos. Locally lifting the curse of dimensionality for nearest neighbor search. Technical report, NEC Research Institute, Princeton, NJ, June 1999.