Fetching the paper…
Reading the bibliography…
Graph-based algorithms have shown great empirical potential for the approximate nearest neighbor (ANN) search problem.
Multidimensional Binary Search Trees Used for Associative Searching
Jon Louis Bentley · 1975
Earlier work this paper cites.
Worst-case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees
D. T. Lee and C. K. Wong · 1977
Earlier work this paper cites.
Two algorithms for constructing a Delaunay triangulation
D. T. Lee and Bruce J. Schachter · 1980
Earlier work this paper cites.
Monotonic search networks for computer vision databases
DW Dearholt, N Gonzales, and G Kurup · 1988
Earlier work this paper cites.
The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles
Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger · 1990
Earlier work this paper cites.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Alexandr Andoni and Piotr Indyk · 2008
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2010
Earlier work this paper cites.
Optimized Product Quantization for Approximate Nearest Neighbor Search
Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun · 2013
Cited alongside, same era.
Cartesian K-Means
Mohammad Norouzi and David J. Fleet · 2013
Cited alongside, same era.
Locally Optimized Product Quantization for Approximate Nearest Neighbor Search
Yannis Kalantidis and Yannis S. Avrithis · 2014
Cited alongside, same era.
Approximate nearest neighbor algorithm based on navigable small world graphs
Yury Malkov, Alexander Ponomarenko, Andrey Logvinov, and Vladimir Krylov · 2014
Cited alongside, same era.
Scalable Nearest Neighbor Algorithms for High Dimensional Data
Marius Muja and David G. Lowe · 2014
Cited alongside, same era.
Practical and optimal LSH for angular distance
Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, and Ludwig Schmidt · 2015
Cited alongside, same era.
https://github.com/facebookresearch/faiss , Accessed: 05-20-2019
Faiss: A library for efficient similarity search and clustering of dense vectors · 2019
Later among the works it cites.
Return of the lernaean hydra: Experimental evaluation of data series approximate similarity search
Karima Echihabi, Kostas Zoumpatianos, Themis Palpanas, and Houda Benbrahim · 2019
Later among the works it cites.
Cong Fu, Changxu Wang, and Deng Cai · 2019
Later among the works it cites.
Fast Approximate Nearest Neighbor Search with the Navigating Spreading-out Graph
Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai · 2019
Later among the works it cites.
Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement
Wen Li, Ying Zhang, Yifang Sun, Wei Wang, Wenjie Zhang, and Xuemin Lin · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Link and Code: Fast Indexing With Graphs and Compact Regression Codes
Matthijs Douze, Alexandre Sablayrolles, and Hervé Jégou · 2018
Cited alongside, same era.
Rand-nsg: Fast accurate billion-point nearest neighbor search on a single node
Suhas Jayaram Subramanya, Fnu Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnawamy, and Rohan Kadekodi · 2019
Later among the works it cites.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Yury A. Malkov and D. A. Yashunin · 2020
Later among the works it cites.