Priority Vantage Points Structures for Similarity Queries in Metric Spaces-Reference-Cited by-同舟云学术

Priority Vantage Points Structures for Similarity Queries in Metric Spaces

Published:2002 Issue: Volume: Page:256-263
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Celik Cengiz

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36087-5_30

Reference13 articles.

1. C. Traina Jr., Agma J. M. Traina, B. Seeger, C. Faloutsos. Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes. EDBT: 51–65. 2000.

2. E. Chávez, J. L. Marroquín, R. A. Baeza-Yates. Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces. SPIRE/CRIWG: 38–46. 1999.

3. E. Chávez, G. Navarro, R. Baeza-Yates, J. L. Marroquín. Proximity Searching in Metric Spaces. ACM Computing Surveys 33(3):273–321. 2001a.

4. E. Chávez, J. L. Marroquín, G. Navarro. Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching. Multimedia Tools and Applications 14(2): 113–135. 2001b.

5. E. Vidal. An Algorithm for Finding Nearest Neighbors in (approximately) Constant Average Time. Pattern Recognition Letters 4:145. 1986.

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

1. Extreme pivots: a pivot selection strategy for faster metric search;Knowledge and Information Systems;2019-11-16

2. Query Filtering with Low-Dimensional Local Embeddings;Similarity Search and Applications;2019

3. Singleton indexes for nearest neighbor search;Information Systems;2016-08

4. Pivot selection for metric-space indexing;International Journal of Machine Learning and Cybernetics;2016-02-03

5. Extreme Pivots for Faster Metric Indexes;Similarity Search and Applications;2013