Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data-Reference-Cited by-同舟云学术

Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data

Published:2018-10 Issue: Volume:465 Page:484-504
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Liu Yingfan,Wei Hao,Cheng Hong^ORCID

Funder

Research Grants Council

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference40 articles.

1. https://github.com/searchivarius/nmslib.

2. https://github.com/spotify/annoy.

3. L2AP: fast cosine similarity search with prefix L-2 norm bounds;Anastasiu;ICDE,2014

4. The inverted multi-index;Babenko,2012

5. Additive quantization for extreme vector compression;Babenko;CVPR,2014

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

1. Speeding up pattern matching in streaming time-series via block vector and multilevel lower bound;Neural Computing and Applications;2023-12-02

2. Medical image retrieval via nearest neighbor search on pre-trained image features;Knowledge-Based Systems;2023-10

3. NNFSRR: Nearest Neighbor Feature Selection and Redundancy Removal Method for Nearest Neighbor Search in Microarray Gene Expression Data;EAI Endorsed Transactions on Pervasive Health and Technology;2023-09-19

4. Accelerating Exact K-Means++ Seeding Using Lower Bound Based Framework;Database Systems for Advanced Applications;2023

5. HCTree+: A workload-guided index for approximate kNN search;Information Sciences;2021-12