Pivot selection techniques for proximity searching in metric spaces

Proceedings - International Conference of the Chilean Computer Science Society, SCCC

Volumn 2001-January, Issue , 2001, Pages 33-40

  Bustos, B ^a   Navarro, G ^a   Chavez E ^b  

^a UNIVERSITY OF CHILE   (Chile)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EFFICIENCY; OPTIMIZATION; STATISTICS; TOPOLOGY;

EFFICIENCY MEASURE; METRIC SPACES; OPTIMIZATION TECHNIQUES; PIVOT SELECTIONS; PROXIMITY SEARCHING; SEARCH ALGORITHMS; SEARCH TIME;

SET THEORY;

EID: 84952928789     PISSN: 15224902     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCCC.2001.972629     Document Type: Conference Paper

References (13)

1. The Sixth DIMACS Implementation Challenge: Available Software, http://www.dimacs.rutgers.edu/Challenges/Sixth/software.html.
2. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fixed-queries trees. In Proc. 5th Combinatorial Pattern Matching (CPM'94), LNCS 807, pages 198-212, 1994.
3. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In Proc. ACM SIGMOD International Conference on Management of Data, pages 357-368, 1997. Sigmod Record 26(2).
4. S. Brin. Near neighbor search in large metric spaces. In Proc. 21st Conference on Very Large Databases (VLDB'95), pages 574-584, 1995.
5. W. Burkhard and R. Keller. Some approaches to best-match file searching. Comm. of the ACM, 16(4):230-236, 1973.
6. E. Chávez, J. Marroquín, and R. Baeza-Yates. Spaghettis: an array based algorithm for similarity queries in metric spaces. In Proc. String Processing and Information Retrieval (SPIRE'99), pages 38-46. IEEE CS Press, 1999.
7. E. Chávez, J. Marroquín, 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. To appear.
8. E. Chávez, G. Navarro, R. Baeza-Yates, and J. Marroquín. Proximity searching in metric spaces. ACM Computing Surveys, 2001. To appear.
9. A. Faragó, T. Linder, and G. Lugosi. Fast nearest-neighbor search in dissimilarity spaces. IEEE Trans. on Pattern Analysis and Machine Intelligence, 15(9):957-962, 1993.
10. L. Micó, J. Oncina, and E. Vidal. A new version of the nearest-neighbor approximating and eliminating search (AESA) with linear preprocessing-time and memory requirements. Pattern Recognition Letters, 15:9-17, 1994.
11. E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters, 4:145-157, 1986.
12. P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA'93), pages 311-321, 1993.
13. P. Yianilos. Excluded middle vantage point forests for nearest neighbor search. In DIMACS Implementation Challenge, ALENEX'99, Baltimore, MD, 1999.