Fetching the paper…
Reading the bibliography…
Approximate nearest neighbor search (ANNS) is a fundamental building block in information retrieval with graph-based indices being the current state-of-the-art and widely used in the industry.
New Loss Functions for Fast Maximum Inner Product Search
Ruiqi Guo, Quan Geng, David Simcha, Felix Chern, Sanjiv Kumar, and Xiang Wu. 2019 · 1908
Earlier work this paper cites.
Streaming Similarity Search over One Billion Tweets Using Parallel Locality-Sensitive Hashing
Narayanan Sundaram, Aizana Turmukhametova, Nadathur Satish, Todd Mostak, Piotr Indyk, Samuel Madden, and Pradeep Dubey. 2013 · 1941
Earlier work this paper cites.
Multidimensional Binary Search Trees Used for Associative Searching
Jon Louis Bentley. 1975 · 1975
Earlier work this paper cites.
Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
Evelyn Fix and J. L. Hodges. 1989 · 1989
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 · 1990
Earlier work this paper cites.
Efficient similarity search in sequence databases. In Foundations of Data Organization and Algorithms , David B. Lomet (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 69–84
Rakesh Agrawal, Christos Faloutsos, and Arun Swami. 1993 · 1993
Earlier work this paper cites.
Approximate Nearest Neighbor Queries in Fixed Dimensions. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, Texas, USA) (SODA ’93) . Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 271–280
Sunil Arya and David M. Mount. 1993 · 1993
Earlier work this paper cites.
An Algorithm for Approximate Closest-point Queries. In Proceedings of the Tenth Annual Symposium on Computational Geometry (Stony Brook, New York, USA) (SCG ’94) . ACM, New York, NY, USA, 160–164
Kenneth L. Clarkson. 1994 · 1994
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) . ACM, New York, NY, USA, 604–613
Piotr Indyk and Rajeev Motwani. 1998 · 1998
Earlier work this paper cites.
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In Proceedings of the 24rd International Conference on Very Large Data Bases (VLDB ’98) . Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 194–205
Roger Weber, Hans-Jörg Schek, and Stephen Blott. 1998 · 1998
Earlier work this paper cites.
Near-optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
Alexandr Andoni and Piotr Indyk. 2008 · 2008
Earlier work this paper cites.
Introduction to Information Retrieval
Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schütze. 2008 · 2008
Earlier work this paper cites.
Spectral Hashing. In Proceedings of the 21st International Conference on Neural Information Processing Systems (Vancouver, British Columbia, Canada) (NIPS’08) . Curran Associates Inc., Red Hook, NY, USA, 1753–1760
Yair Weiss, Antonio Torralba, and Rob Fergus. 2008 · 2008
Earlier work this paper cites.
iSAX 2.0: Indexing and Mining One Billion Time Series. In 2013 IEEE 13th International Conference on Data Mining . IEEE Computer Society, Los Alamitos, CA, USA, 58–67
A. Camerra, E. Keogh, T. Palpanas, and J. Shieh. 2010 · 2010
Earlier work this paper cites.
Product Quantization for Nearest Neighbor Search
Hervé Jégou, Matthijs Douze, and Cordelia Schmid. 2011 · 2010
Earlier work this paper cites.
Efficient K-nearest Neighbor Graph Construction for Generic Similarity Measures. In Proceedings of the 20th International Conference on World Wide Web (Hyderabad, India) (WWW ’11) . ACM, New York, NY, USA, 577–586
Wei Dong, Charikar Moses, and Kai Li. 2011 · 2011
Earlier work this paper cites.
Searching in one billion vectors: Re-rank with source coding. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011, May 22-27, 2011, Prague Congress Center, Prague, Czech Republic . 861–864
Herve Jegou, Romain Tavenard, Matthijs Douze, and Laurent Amsaleg. 2011 · 2011
Earlier work this paper cites.
Hashing with graphs. In ICML
Wei Liu, Jun Wang, Sanjiv Kumar, and Shih-Fu Chang. 2011 · 2011
Earlier work this paper cites.
The inverted multi-index. In 2012 IEEE Conference on Computer Vision and Pattern Recognition . 3069–3076
A. Babenko and V. Lempitsky. 2012 · 2012
Cited alongside, same era.
The Art of Multiprocessor Programming, Revised Reprint (1st ed.)
Maurice Herlihy and Nir Shavit. 2012 · 2012
Cited alongside, same era.
Scalable k-NN graph construction for visual descriptors. In 2012 IEEE Conference on Computer Vision and Pattern Recognition . 1106–1113
J. Wang, J. Wang, G. Zeng, Z. Tu, R. Gan, and S. Li. 2012 · 2012
Cited alongside, same era.
Optimized Product Quantization
Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun. 2014 · 2013
Cited alongside, same era.
Additive Quantization for Extreme Vector Compression. In 2014 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2014, Columbus, OH, USA, June 23-28, 2014 . IEEE Computer Society, 931–938
Artem Babenko and Victor S. Lempitsky. 2014 · 2014
Cited alongside, same era.
HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces
Akhil Arora, Sakshi Sinha, Piyush Kumar, and Arnab Bhattacharya. 2018 · 2018
Later among the works it cites.
Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
Dmitry Baranchuk, Artem Babenko, and Yury Malkov. 2018b · 2018
Later among the works it cites.
Annoy: Approximate Nearest Neighbors in C++/Python
Erik Bernhardsson. 2018 · 2018
Later among the works it cites.
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2018 · 2018
Later among the works it cites.
Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data
Masajiro Iwasaki and Daisuke Miyazaki. 2018 · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quiescent Consistency: Defining and Verifying Relaxed Linearizability. In FM 2014: Formal Methods , Cliff Jones, Pekka Pihlajasaari, and Jun Sun (Eds.). Springer International Publishing, Cham, 200–214
John Derrick, Brijesh Dongol, Gerhard Schellhorn, Bogdan Tofan, Oleg Travkin, and Heike Wehrheim. 2014 · 2014
Cited alongside, same era.
Locally Optimized Product Quantization for Approximate Nearest Neighbor Search. In 2014 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2014, Columbus, OH, USA, June 23-28, 2014 . 2329–2336
Yannis Kalantidis and Yannis Avrithis. 2014 · 2014
Cited alongside, same era.
Scalable Nearest Neighbor Algorithms for High Dimensional Data
M. Muja and D. G. Lowe. 2014 · 2014
Cited alongside, same era.
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index
Yifang Sun, Wei Wang, Jianbin Qin, Ying Zhang, and Xuemin Lin. 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) . ACM, New York, NY, USA, 793–801
Alexandr Andoni and Ilya Razenshteyn. 2015 · 2015
Cited alongside, same era.
Scalable Graph Hashing with Feature Transformation. In Proceedings of the 24th International Conference on Artificial Intelligence (Buenos Aires, Argentina) (IJCAI’15) . AAAI Press, 2248–2254
Qing-Yuan Jiang and Wu-Jun Li. 2015 · 2015
Cited alongside, same era.
Neighbor-Sensitive Hashing
Yongjoo Park, Michael Cafarella, and Barzan Mozafari. 2015 · 2015
Cited alongside, same era.
Later among the works it cites.
Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes
Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos, and Themis Palpanas. 2018 · 2018
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 · 2019
Later among the works it cites.
Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graphs
Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai. 2019 · 2019
Later among the works it cites.
Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement
W. Li, Y. Zhang, Y. Sun, W. Wang, M. Li, W. Zhang, and X. Lin. 2020 · 2019
Later among the works it cites.
DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14 December 2019, Vancouver, BC, Canada , Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d’Alché-Buc, Emily B. Fox, and Roman Garnett (Eds.). 13748–13758
Suhas Jayaram Subramanya, Fnu Devvrit, Rohan Kadekodi, Ravishankar Krishnawamy, and Harsha Vardhan Simhadri. 2019 · 2019
Later among the works it cites.
Julie Tibshirani. 2019
2019
Later among the works it cites.
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
Martin Aumüller, Erik Bernhardsson, and Alexander Faithfull. 2020 · 2020
Later among the works it cites.
Michael Sokolov. 2020
2020
Later among the works it cites.
AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data
Chuangxian Wei, Bin Wu, Sheng Wang, Renjie Lou, Chaoqun Zhan, Feifei Li, and Yuanzhe Cai. 2020 · 2020
Later among the works it cites.
PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search
Bolong Zheng, Xi Zhao, Lianggui Weng, Nguyen Quoc Viet Hung, Hang Liu, and Christian S. Jensen. 2020 · 2020
Later among the works it cites.
DeepXML: A Deep Extreme Multi-Label Learning Framework Applied to Short Text Documents. In Proceedings of the 14th International Conference on Web Search and Data Mining (Jerusalem, Israel) (WSDM ’21) . Association for Computing Machinery, New York, NY, USA, 8
Kunal Dahiya, Deepak Saini, Anshul Mittal, Ankush Shaw, Kushal Dave, Akshay Soni, Himanshu Jain, Sumeet Agarwal, and Manik Varma. 2021 · 2021
Closest in time.
Mengzhao Wang, Xiaoliang Xu, Qiang Yue, and Yuxiang Wang. 2021 · 2021
Closest in time.