Spatial selection of sparse pivots for similarity search in metric spaces

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

Volumn 4362 LNCS, Issue , 2007, Pages 434-445

  Pedreira, Oscar ^a   Brisaboa, Nieves R ^a  

^a UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; NUMERICAL METHODS; STORAGE ALLOCATION (COMPUTER);

NESTED METRIC SPACES; SPARSE SPATIAL SELECTION (SSS);

STATE SPACE METHODS;

EID: 38149056410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69507-3_37     Document Type: Conference Paper

References (12)

1. Chavez, E., Navarro, G., Baeza-Yates, R. and Marroquín, J.L.: Searching in Metric Spaces. ACM Computing Surveys 33 3 (2001) 273-321
2. Burkhard, W.A. and Keller, R.M.: Some Approaches to Best-Match File Searching. Communications of the ACM 16 4 (1973) 230-236
3. Baeza-Yates, R., Cunto, W., Manber, U., and Wu, S.: Proximity Matching Using Fixed-Queries Trees. In: Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, Springer-Verlag (1994) 198-212
4. Baeza-Yates, R.: Searching: an Algorithmic Tour. Encyclopedia of Computer Science and Technology 37 (1997) 331-359
5. Chavez, E., Marroquín, J.L., and Navarro, G.: Overcoming the Curse of Dimensionality. In: European Workshop on Content-based Multimedia Indexing (CBMI'99). (1999) 57-64
6. Yianilos, P.: Data Structures and Algorithms for Nearest-Neighbor Search in General Metric Spaces. In: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press (1993) 311-321
7. Bozkaya, T. and Ozsoyoglu, M.: Distance-Based Indexing for High-Dimensional Metric Spaces. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD 1997), ACM Press (1997) 357-368
8. Yianilos, P.: Excluded Middle Vantage Point Forests for Nearest Neighbor Search. In: Proceedings of the 6th DIMACS Implementation Challenge: Near Neighbor Searches (ALENEX 1999), Baltimore, Maryland, USA (1999)
9. Vidal, E.: An Algorithm for Finding Nearest Neighbors in (Aproximately) Constant Average Time. Pattern Recognition Letters 4 (1986) 145-157
10. Micó, L., Oncina, J., and Vidal, R.E.: A New Version of the Nearest-Neighbor Approximating and Eliminating Search (Aesa) with Linear Pre-Processing Time and Memory Requirements. Pattern Recognition Letters 15 (1994) 9-17
11. Brin, S.: Near Neighbor Search in Large Metric Spaces. In: 21st Conference on Very Large Databases (1995)
12. Bustos, B., Navarro, G., and Chavez, E.: Pivot Selection Techniques for Proximity Search in Metric Spaces. In: SCCC 2001, Proceedings of the XXI Conference of the Chilean Computer Science Society, IEEE Computer Science Press (2001) 33-40