Fetching the paper…
Reading the bibliography…
Nearest neighbor search (NNS) has a wide range of applications in information retrieval, computer vision, machine learning, databases, and other areas.
<i>K</i>-d Trees for Semidynamic Point Sets. In Proceedings of the Sixth Annual Symposium on Computational Geometry (Berkley, California, USA) (SCG ’90) . Association for Computing Machinery, New York, NY, USA, 187–197
Jon Louis Bentley. 1990 · 1990
Earlier work this paper cites.
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (Dallas, Texas, USA) (STOC ’98) . Association for Computing Machinery, New York, NY, USA, 604–613
Piotr Indyk and Rajeev Motwani. 1998 · 1998
Earlier work this paper cites.
Interval Estimation for a Binomial Proportion
Lawrence D. Brown, T. Tony Cai, and Anirban DasGupta. 2001 · 2001
Earlier work this paper cites.
Fast approximate nearest neighbors with automatic algorithm configuration. In In VISAPP International Conference on Computer Vision Theory and Applications . 331–340
Marius Muja and David G. Lowe. 2009 · 2009
Earlier work this paper cites.
Which Spatial Partition Trees Are Adaptive to Intrinsic Dimension?. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (Montreal, Quebec, Canada) (UAI ’09) . AUAI Press, Arlington, Virginia, USA, 565–574
Nakul Verma, Samory Kpotufe, and Sanjoy Dasgupta. 2009 · 2009
Earlier work this paper cites.
Spectral Hashing
Yair Weiss, Antonio Torralba, and Rob Fergus. 2009 · 2009
Earlier work this paper cites.
Product Quantization for Nearest Neighbor Search
H. Jégou, M. Douze, and C. Schmid. 2011 · 2011
Earlier work this paper cites.
Approximate Principal Direction Trees. In Proceedings of the 29th International Coference on International Conference on Machine Learning (Edinburgh, Scotland) (ICML’12) . Omnipress, Madison, WI, USA, 1611–1618
Mark McCartin-Lim, Andrew McGregor, and Rui Wang. 2012 · 2012
Earlier work this paper cites.
Engineering Efficient and Effective Non-metric Space Library. In Similarity Search and Applications , Nieves Brisaboa, Oscar Pedreira, and Pavel Zezula (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 280–293
Leonid Boytsov and Bilegsaikhan Naidan. 2013 · 2013
Earlier work this paper cites.
Optimized Product Quantization for Approximate Nearest Neighbor Search. In 2013 IEEE Conference on Computer Vision and Pattern Recognition . IEEE, 2946–2953
T. Ge, K. He, Q. Ke, and J. Sun. 2013 · 2013
Cited alongside, same era.
Approximate nearest neighbor algorithm based on navigable small world graphs
Yu Malkov, Alexander Ponomarenko, Andrey Logvinov, and Vladimir Krylov. 2013 · 2013
Cited alongside, same era.
Lecture notes on expansion, sparsest cut, and spectral graph theory
Luca Trevisan. 2013 · 2013
Cited alongside, same era.
Data-Dependent Hashing Based on p-Stable Distribution
X. Bai, H. Yang, J. Zhou, P. Ren, and J. Cheng. 2014 · 2014
Cited alongside, same era.
Distance Encoded Product Quantization. In 2014 IEEE Conference on Computer Vision and Pattern Recognition . IEEE, 2139–2146
J. Heo, Z. Lin, and S. Yoon. 2014 · 2014
Cited alongside, same era.
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
Y. A. Malkov and D. A. Yashunin. 2016 · 2016
Later among the works it cites.
MLlib: Machine Learning in Apache Spark
Xiangrui Meng, Joseph Bradley, Burak Yavuz, Evan Sparks, Shivaram Venkataraman, Davies Liu, Jeremy Freeman, DB Tsai, Manish Amde, Sean Owen, Doris Xin, Reynold Xin, Michael J. Franklin, Reza Zadeh, Matei Zaharia, and Ameet Talwalkar. 2016 · 2016
Later among the works it cites.
Apache Spark: A Unified Engine for Big Data Processing
Matei Zaharia, Reynold S. Xin, Patrick Wendell, Tathagata Das, Michael Armbrust, Ankur Dave, Xiangrui Meng, Josh Rosen, Shivaram Venkataraman, Michael J. Franklin, Ali Ghodsi, Joseph Gonzalez, Scott Shenker, and Ion Stoica. 2016 · 2016
Later among the works it cites.
Data-Dependent Hashing via Nonlinear Spectral Gaps. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Los Angeles, CA, USA) (STOC 2018) . Association for Computing Machinery, New York, NY, USA, 787–800
Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya Razenshteyn, and Erik Waingarten. 2018 · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Locally optimized product quantization for approximate nearest neighbor search. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition . IEEE, 2321–2328
Yannis Kalantidis and Yannis Avrithis. 2014 · 2014
Cited alongside, same era.
Optimal Data-Dependent Hashing for Approximate Near Neighbors. In Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing (Portland, Oregon, USA) (STOC ’15) . Association for Computing Machinery, New York, NY, USA, 793–801
Alexandr Andoni and Ilya Razenshteyn. 2015 · 2015
Cited alongside, same era.
Randomized Partition Trees for Nearest Neighbor Search
Sanjoy Dasgupta and Kaushik Sinha. 2015 · 2015
Cited alongside, same era.
Pruned Bi-directed K-nearest Neighbor Graph for Proximity Search. In Similarity Search and Applications , Laurent Amsaleg, Michael E. Houle, and Erich Schubert (Eds.). Springer International Publishing, Cham, 20–33
Masajiro Iwasaki. 2016 · 2016
Cited alongside, same era.
Martin Aumuller, Erik Bernhardsson, and Alexander John Faithfull. 2018 · 2018
Later among the works it cites.
PyNNDescent
L. McInnes. 2018 · 2018
Later among the works it cites.
Billion-scale similarity search with GPUs
J. Johnson, M. Douze, and H. Jégou. 2019 · 2019
Later among the works it cites.
ANNOY library
Spotify. 2013 · 2019
Later among the works it cites.