Probabilistic proximity searching algorithms based on compact partitions

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

Volumn 2476, Issue , 2002, Pages 284-297

  Bustos, Benjamin ^b   Navarro, Gonzalo ^a,b  

^a Center for Web Research   (Chile)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; SET THEORY; TOPOLOGY;

CURSE OF DIMENSIONALITY; EXACT ALGORITHMS; HIGH DIMENSIONS; METRIC SPACE SEARCHING; METRIC SPACES; PROBABILISTIC ALGORITHM; PROXIMITY SEARCHING; RECENT TRENDS;

ALGORITHMS;

EID: 84958751458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45735-6_25     Document Type: Conference Paper

References (14)

1. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison- Wesley, 1999.
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, G. Navarro, and E. Chávez. Pivot selection techniques for proximity searchingin metric spaces. In Proc. of the XXI Conference of the Chilean Computer Science Society (SCCC’01), pages 33–40. IEEE CS Press, 2001.
4. E. Chávez and G. Navarro. An effective clustering algorithm to index high dimensional metric spaces. In Proc. 7th South American Symposium on String Processing and Information Retrieval (SPIRE’00), pages 75–86. IEEE CS Press, 2000.
5. E. Chávez and G. Navarro. A probabilistic spell for the curse of dimensionality. In Proc. 3rd Workshop on Algorithm Engineering and Experiments (ALENEX’01), LNCS 2153, pages 147–160, 2001
6. E. Chávez, G. Navarro, R. Baeza-Yates, and J. Marroquín. Proximity searching in metric spaces. ACM Computing Surveys, 33(3):273–321, 2001.
7. 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.
8. F. Dehne and H. Noltemeier. Voronoi trees and clusteringp roblems. Information Systems, 12(2):171–175, 1987.
9. D. Harman. Overview of the Third Text REtrieval Conference. In Proc. Third Text REtrieval Conference (TREC-3), pages 1–19, 1995. NIST Special Publication 500-207.
10. G. Hjaltason and H. Samet. Incremental similarity search in multimedia databases. Technical Report TR 4199, Department of Computer Science, University of Maryland, November 2000.
11. I. Kalantari and G. McDonald. A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering, 9(5):631–634, 1983.
12. G. Navarro. Searchingin metric spaces by spatial approximation. The Very Large Databases Journal (VLDBJ), 2002. To appear. Earlier version in SPIRE’99, IEEE CS Press.
13. H. Noltemeier, K. Verbarg, and C. Zirkelbach. Monotonous Bisector∗ Trees – a tool for efficient partitioningof complex schenes of geometric objects. In Data Structures and Efficient Algorithms, LNCS 594, pages 186–203. Springer-Verlag, 1992.
14. J. Uhlmann. Satisfyingg eneral proximity/similarity queries with metric trees. Information Processing Letters, 40:175–179, 1991.