Fetching the paper…
Reading the bibliography…
Approximate Nearest Neighbor (ANN) search is a fundamental technique for (e.g.,) the deployment of recommender systems.
Chain-links
Frigyes Karinthy · 1929
Earlier work this paper cites.
An algorithm for finding nearest neighbors
Jerome H. Friedman, F. Baskett, and L. Shustek · 1975
Earlier work this paper cites.
An algorithm for finding best matches in logarithmic expected time
Jerome H. Friedman, J. Bentley, and R. Finkel · 1977
Earlier work this paper cites.
Six degrees of separation: A play
John Guare · 1990
Earlier work this paper cites.
The TV-tree: An index structure for high-dimensional data
King-Ip Lin, H. V. Jagadish, and Christos Faloutsos · 1994
Earlier work this paper cites.
The X-tree : An index structure for high-dimensional data
Stefan Berchtold, Daniel A. Keim, and Hans-Peter Kriegel · 1996
Earlier work this paper cites.
On the resemblance and containment of documents
Andrei Z. Broder · 1997
Earlier work this paper cites.
Min-wise independent permutations
Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher · 1998
Earlier work this paper cites.
Approximate nearest neighbors: Towards removing the curse of dimensionality
Piotr Indyk and Rajeev Motwani · 1998
Earlier work this paper cites.
Approximate similarity retrieval with M-trees
Pavel Zezula, Pasquale Savino, Giuseppe Amato, and Fausto Rabitti · 1998
Earlier work this paper cites.
Similarity search in high dimensions via hashing
Aristides Gionis, Piotr Indyk, and Rajeev Motwani · 1999
Earlier work this paper cites.
The small-world phenomenon: an algorithmic perspective
Jon M. Kleinberg · 2000
Earlier work this paper cites.
The a-tree: An index structure for high-dimensional spaces using relative approximation
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uemura, and Haruhiko Kojima · 2000
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms
Moses S. Charikar · 2002
Earlier work this paper cites.
Searching in metric spaces by spatial approximation
Gonzalo Navarro · 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.
Using sketches to estimate associations
Ping Li and Kenneth Ward Church · 2005
Earlier work this paper cites.
Using the k -nearest neighbor graph for proximity searching in metric spaces
Rodrigo Paredes and Edgar Chávez · 2005
Earlier work this paper cites.
Peer to peer multidimensional overlays: Approximating complex structures
Olivier Beaumont, Anne-Marie Kermarrec, and Etienne Riviere · 2007
Earlier work this paper cites.
Content-based recommendation systems
Michael J. Pazzani and Daniel Billsus · 2007
Earlier work this paper cites.
Spectral hashing
Yair Weiss, Antonio Torralba, and Robert Fergus · 2008
Cited alongside, same era.
Learning the click-through rate for rare/new ads from similar ads
Kushal S. Dave and Vasudeva Varma · 2010
Cited alongside, same era.
Searching with expectations
Harsimrat Sandhawalia and Hervé Jégou · 2010
Cited alongside, same era.
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 near neighbor search in high-dimensional binary data
Anshumali Shrivastava and Ping Li · 2012
Cited alongside, same era.
Optimized product quantization for approximate nearest neighbor search
Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun · 2013
Cited alongside, same era.
UCI machine learning repository, 2017
Dheeru Dua and Casey Graff · 2017
Later among the works it cites.
Theory of the GMM kernel
Ping Li and Cun-Hui Zhang · 2017
Later among the works it cites.
Ping Li · 2018
Later among the works it cites.
Non-metric similarity graphs for maximum inner product search
Stanislav Morozov and Artem Babenko · 2018
Later among the works it cites.
Learning tree-based deep model for recommender systems
Han Zhu, Xiang Li, Pengye Zhang, Guozheng Li, Jie He, Han Li, and Kun Gai · 2018
Later among the works it cites.
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
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nearest neighbor search in google correlate
Dan Vanderkam, Rob Schonberger, Henry Rowley, and Sanjiv Kumar · 2013
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.
Glove: Global vectors for word representation
Jeffrey Pennington, Richard Socher, and Christopher D. Manning · 2014
Cited alongside, same era.
Scalable heterogeneous translated hashing
Ying Wei, Yangqiu Song, Yi Zhen, Bo Liu, and Qiang Yang · 2014
Cited alongside, same era.
Composite quantization for approximate nearest neighbor search
Ting Zhang, Chao Du, and Jingdong Wang · 2014
Cited alongside, same era.
Cache locality is not enough: High-performance nearest neighbor search with product quantization fast scan
Fabien André, Anne-Marie Kermarrec, and Nicolas Le Scouarnec · 2015
Cited alongside, same era.
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.
Sign-full random projections
Ping Li · 2019
Later among the works it cites.
Random projections with asymmetric quantization
Xiaoyun Li and Ping Li · 2019
Later among the works it cites.
Revisiting kd-tree for nearest neighbor search
Parikshit Ram and Kaushik Sinha · 2019
Later among the works it cites.
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.
Joint optimization of tree-based index and deep model for recommender systems
Han Zhu, Daqing Chang, Ziru Xu, Pengye Zhang, Xiang Li, Jie He, Han Li, Jian Xu, and Kun Gai · 2019
Later among the works it cites.
Deep retrieval: Learning a retrievable structure for large-scale recommendations
Weihao Gao, Xiangjun Fan, Chong Wang, Jiankai Sun, Kai Jia, Wenzhi Xiao, Ruofan Ding, Xingyan Bin, Hui Yang, and Xiaobing Liu · 2020
Later among the works it cites.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Yury Malkov and Dmitry Yashunin · 2020
Later among the works it cites.
SONG: approximate nearest neighbor search on GPU
Weijie Zhao, Shulong Tan, and Ping Li · 2020
Later among the works it cites.
Learning optimal tree models under beam search
Jingwei Zhuo, Ziru Xu, Wei Dai, Han Zhu, Han Li, Jian Xu, and Kun Gai · 2020
Later among the works it cites.
Consistent sampling through extremal process
Ping Li, Xiaoyun Li, Gennady Samorodnitsky, and Weijie Zhao · 2021
Later among the works it cites.
FreshDiskANN: A fast and accurate graph-based ann index for streaming similarity search
Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy, and Harsha Vardhan Simhadri · 2021
Later among the works it cites.
EGM: Enhanced graph-based model for large-scale video advertisement search
Tan Yu, Jie Liu, Yi Yang, Yi Li, Hongliang Fei, and Ping Li · 2022
Closest in time.