Fetching the paper…
Reading the bibliography…
Graph-based algorithms have demonstrated state-of-the-art performance in the nearest neighbor search (NN-Search) problem.
Discriminatory analysis. nonparametric discrimination: Consistency properties
Evelyn Fix and Joseph Lawson Hodges · 1989
Earlier work this paper cites.
An introduction to kernel and nearest-neighbor nonparametric regression
Naomi S Altman · 1992
Earlier work this paper cites.
Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding
V Ramasubramanian and Kuldip K Paliwal · 1992
Earlier work this paper cites.
Item-based collaborative filtering recommendation algorithms
Badrul Sarwar, George Karypis, Joseph Konstan, and John Riedl · 2001
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms
Moses S Charikar · 2002
Earlier work this paper cites.
Locality-sensitive hashing scheme based on p-stable distributions
Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S Mirrokni · 2004
Earlier work this paper cites.
The structure and dynamics of networks
Mark Ed Newman, Albert-László Ed Barabási, and Duncan J Watts · 2006
Earlier work this paper cites.
Nearest-neighbor methods in learning and vision: theory and practice (neural information processing)
Gregory Shakhnarovich, Trevor Darrell, and Piotr Indyk · 2006
Earlier work this paper cites.
Fast approximate knn graph construction for high dimensional data via recursive lanczos bisection
Jie Chen, Haw-ren Fang, and Yousef Saad · 2009
Earlier work this paper cites.
Product quantization for nearest neighbor search
Herve Jegou, Matthijs Douze, and Cordelia Schmid · 2010
Earlier work this paper cites.
Efficient k-nearest neighbor graph construction for generic similarity measures
Wei Dong, Charikar Moses, and Kai Li · 2011
Earlier work this paper cites.
Fast approximate nearest-neighbor search with k-nearest neighbor graph
Kiana Hajebi, Yasin Abbasi-Yadkori, Hossein Shahbazi, and Hong Zhang · 2011
Cited alongside, same era.
Fast knn graph construction with locality sensitive hashing
Yan-Ming Zhang, Kaizhu Huang, Guanggang Geng, and Cheng-Lin Liu · 2013
Cited alongside, same era.
Optimal data-dependent hashing for approximate near neighbors
Alexandr Andoni and Ilya Razenshteyn · 2015
Cited alongside, same era.
Optimal hashing-based time-space trade-offs for approximate near neighbors
Alexandr Andoni, Thijs Laarhoven, Ilya Razenshteyn, and Erik Waingarten · 2017
Cited alongside, same era.
Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
Martin Aumüller, Erik Bernhardsson, and Alexander Faithfull · 2017
Cited alongside, same era.
Fast approximate nearest neighbor search with the navigating spreading-out graph
On efficient retrieval of top similarity vectors
Shulong Tan, Zhixin Zhou, Zhaozhuo Xu, and Ping Li · 2019
Later among the works it cites.
Möbius transformation for fast inner product search on graph
Zhixin Zhou, Shulong Tan, Zhaozhuo Xu, and Ping Li · 2019
Later among the works it cites.
Randomized near-neighbor graphs, giant components and applications in data science
Ariel Jaffe, Yuval Kluger, George C Linderman, Gal Mishne, and Stefan Steinerberger · 2020
Later among the works it cites.
Improved guarantees for k-means++ and k-means++ parallel
Konstantin Makarychev, Aravind Reddy, and Liren Shan · 2020
Later among the works it cites.
Graph-based nearest neighbor search: From practice to theory
Liudmila Prokhorenkova and Aleksandr Shekhovtsov · 2020
Later among the works it cites.
Song: Approximate nearest neighbor search on gpu
Weijie Zhao, Shulong Tan, and Ping Li · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai · 2017
Cited alongside, same era.
Revisiting the inverted indices for billion-scale approximate nearest neighbors
Dmitry Baranchuk, Artem Babenko, and Yury Malkov · 2018
Cited alongside, same era.
Graph-based time-space trade-offs for approximate near neighbors
Thijs Laarhoven · 2018
Cited alongside, same era.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Yu A Malkov and Dmitry A Yashunin · 2018
Cited alongside, same era.
Mobius: towards the next generation of query-ad matching in baidu’s sponsored search
Miao Fan, Jiacheng Guo, Shuai Zhu, Shuo Miao, Mingming Sun, and Ping Li · 2019
Cited alongside, same era.
Generalization through memorization: Nearest neighbor language models
Urvashi Khandelwal, Omer Levy, Dan Jurafsky, Luke Zettlemoyer, and Mike Lewis · 2019
Cited alongside, same era.
Mongoose: A learnable lsh framework for efficient neural network training
Beidi Chen, Zichang Liu, Binghui Peng, Zhaozhuo Xu, Jonathan Lingjie Li, Tri Dao, Zhao Song, Anshumali Shrivastava, and Christopher Re
Cited in the paper.
Later among the works it cites.
Reverse maximum inner product search: How to efficiently find users who would like to buy my item?
Daichi Amagata and Takahiro Hara · 2021
Later among the works it cites.
Oblivious sketching-based central path method for solving linear programming problems
Zhao Song and Zheng Yu · 2021
Later among the works it cites.
Fast sketching of polynomial kernels of polynomial degree
Zhao Song, David Woodruff, Zheng Yu, and Lichen Zhang · 2021
Later among the works it cites.
Norm adjusted proximity graph for fast inner product retrieval
Shulong Tan, Zhaozhuo Xu, Weijie Zhao, Hongliang Fei, Zhixin Zhou, and Ping Li · 2021
Later among the works it cites.