Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order-Reference-Cited by-同舟云学术

Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order

Published:2005 Issue: Volume: Page:405-414
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chávez Edgar,Figueroa Karina,Navarro Gonzalo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11579427_41

Reference18 articles.

1. Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching in fixed dimension. In: Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA 1994), pp. 573–583 (1994)

2. Brin, S.: Near neighbor search in large metric spaces. In: Proc. 21st Conference on Very Large Databases (VLDB 1995), pp. 574–584 (1995)

3. Bustos, B., Navarro, G.: Probabilistic proximity search algorithms based on compact partitions. Journal of Discrete Algorithms (JDA) 2(1), 115–134 (2003)

4. Lecture Notes in Computer Science;E. Chávez,2004

5. Chávez, E., Marroquin, J.L., Navarro, G.: Fixed queries array: A fast and economical data structure for proximity searching. Multimedia Tools and Applications (MTAP) 14(2), 113–135 (2001)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. CLIMBER: Pivot-Based Approximate Similarity Search Over Big Data Series;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. Boosting the Permutation Index for Similarity Searching Using an Eclectic Approach;Communications in Computer and Information Science;2023

3. GPU Permutation Index: Good Trade-Off Between Efficiency and Results Quality;Communications in Computer and Information Science;2022

4. Shortening the Candidate List for Similarity Searching Using Inverted Index;Lecture Notes in Computer Science;2021

5. On Generalizing Permutation-Based Representations for Approximate Search;Similarity Search and Applications;2021