FINGER: Fast Inference for Graph-based Approximate Nearest Neighbor Search-Reference-Cited by-同舟云学术

FINGER: Fast Inference for Graph-based Approximate Nearest Neighbor Search

Published:2023-04-30 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Web Conference 2023
language:
Short-container-title:

Author:

Chen Patrick¹^ORCID,Chang Wei-Cheng²^ORCID,Jiang Jyun-Yu²^ORCID,Yu Hsiang-Fu²^ORCID,Dhillon Inderjit³^ORCID,Hsieh Cho-Jui⁴^ORCID

Affiliation:

1. UCLA, USA

2. Amazon, USA

3. UT Austin; Google, USA

4. UCLA;Amazon, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3543507.3583318

Reference50 articles.

1. 2019. IEEE Standard for Floating-Point Arithmetic . IEEE Std 754- 2019 (Revision of IEEE 754-2008) (2019), 1–84. https://doi.org/10.1109/IEEESTD.2019.8766229 10.1109/IEEESTD.2019.8766229 2019. IEEE Standard for Floating-Point Arithmetic. IEEE Std 754-2019 (Revision of IEEE 754-2008) (2019), 1–84. https://doi.org/10.1109/IEEESTD.2019.8766229

2. Sunil Arya and David M Mount. 1993. Approximate nearest neighbor queries in fixed dimensions.. In SODA Vol. 93. Citeseer 271–280. Sunil Arya and David M Mount. 1993. Approximate nearest neighbor queries in fixed dimensions.. In SODA Vol. 93. Citeseer 271–280.

3. ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms

4. Voronoi diagrams—a survey of a fundamental geometric data structure

5. Norbert Beckmann Hans-Peter Kriegel Ralf Schneider and Bernhard Seeger. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD. 322–331. Norbert Beckmann Hans-Peter Kriegel Ralf Schneider and Bernhard Seeger. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD. 322–331.

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

1. Stratified Graph Indexing for efficient search in deep descriptor databases;International Journal of Multimedia Information Retrieval;2024-08-07

2. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search;Proceedings of the VLDB Endowment;2024-07

3. An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval;Proceedings of the 2024 International Conference on Multimedia Retrieval;2024-05-30

4. RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search;Proceedings of the ACM on Management of Data;2024-05-29

5. Advancing Automatic Subject Indexing: Combining Weak Supervision with Extreme Multi-label Classification;Lecture Notes in Computer Science;2024