Searching in metric spaces by spatial approximation

String Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999

Volumn , Issue , 1999, Pages 141-148

  Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DATA STRUCTURES; FORESTRY; GROUPWARE; INFORMATION RETRIEVAL; SET THEORY; TOPOLOGY;

COMPLEXITY MEASURES; DISTANCE FUNCTIONS; HIGH-DIMENSIONAL; METRIC SPACES; REAL APPLICATIONS;

TREES (MATHEMATICS);

EID: 85010448535     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.1999.796589     Document Type: Conference Paper

References (15)

1. F. Aurenhammer. Voronoi diagrams-A survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3), 1991.
2. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fixed-queries trees. In Proc. CPM'94, LNCS 807, pages 198-212, 1994.
3. J. Bentley. Multidimensional binary search trees in database applications. IEEE Trans. on Software Engineering, 5(4):333-340, 1979.
4. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In Proc. SIGMOD'97, pages 357-368, 1997. Sigmod Record 26(2).
5. S. Brin. Near neighbor search in large metric spaces. In Proc. VLDB'95, pages 574-584, 1995.
6. W. Burkhard and R. Keller. Some approaches to best-match file searching. CACM, 16(4):230-236, 1973.
7. E. Chavez and J. Marroqumn. Proximity queries in metric spaces. In Proc. WSP'97, pages 21-36. Carleton University Press, 1997.
8. E. Chavez, J. Marroquin, and R. Baeza-Yates. Spaghettis: An array based algorithm for similarity queries in metric spaces. In Proc. SPIRE'99, 1999.
9. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD'84, pages 47-57, 1984.
10. L. Micó, J. Oncina, and R. Carrasco. A fast branch and bound nearest neighbor classifier in metric spaces. Patt. Recog. Lett., 17:731-739, 1996.
11. 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. Patt. Recog. Lett., 15:9-17, 1994.
12. S. Nene and S. Nayar. A simple algorithm for nearest neighbor search in high dimensions. IEEE Trans. PAMI, 19(9):989-1003, 1997.
13. J. Uhlmann. Satisfying general proximity/similarity queries with metric trees. IPL, 40:175-179, 1991.
14. E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Patt. Recog. Lett., 4:145-157, 1986.
15. P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. SODA '93, pages 311-321, 1993.