Fetching the paper…
Reading the bibliography…
Approximate Nearest neighbor search (ANNS) is fundamental and essential operation in applications from many domains, such as databases, machine learning, multimedia, and computer vision.
A branch and bound algorithms for computing k-nearest neighbors
K. Fukunaga and P. M. Narendra · 1975
Earlier work this paper cites.
Analyzing and modeling the maximum diversity problem by zero-one programming*
C.-C. Kuo, F. Glover, and K. S. Dhir · 1993
Earlier work this paper cites.
Data structures and algorithms for nearest neighbor search in general metric spaces
P. N. Yianilos · 1993
Earlier work this paper cites.
Near neighbor search in large metric spaces
S. Brin · 1995
Earlier work this paper cites.
Quantization
R. M. Gray and D. L. Neuhoff · 1998
Earlier work this paper cites.
Approximate nearest neighbors: Towards removing the curse of dimensionality
P. Indyk and R. Motwani · 1998
Earlier work this paper cites.
A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
R. Weber, H.-J. Schek, and S. Blott · 1998
Earlier work this paper cites.
Locality-sensitive hashing scheme based on p-stable distributions
M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni · 2004
Earlier work this paper cites.
Fast approximate similarity search in extremely high-dimensional data sets
M. E. Houle and J. Sakuma · 2005
Earlier work this paper cites.
Cover trees for nearest neighbor
A. Beygelzimer, S. Kakade, and J. Langford · 2006
Earlier work this paper cites.
City-scale location recognition
G. Schindler, M. A. Brown, and R. Szeliski · 2007
Earlier work this paper cites.
An empirical evaluation of supervised learning in high dimensions
R. Caruana, N. Karampatziakis, and A. Yessenalina · 2008
Earlier work this paper cites.
Random projection trees and low dimensional manifolds
S. Dasgupta and Y. Freund · 2008
Earlier work this paper cites.
Optimised kd-trees for fast image descriptor matching
C. Silpa-Anan and R. I. Hartley · 2008
Earlier work this paper cites.
Hubs in space: Popular nearest neighbors in high-dimensional data
M. Radovanovic, A. Nanopoulos, and M. Ivanovic · 2010
Earlier work this paper cites.
Fast approximate similarity search based on degree-reduced neighborhood graphs
K. Aoyama, K. Saito, H. Sawada, and N. Ueda · 2011
Cited alongside, same era.
Efficient k-nearest neighbor graph construction for generic similarity measures
W. Dong, M. Charikar, and K. Li · 2011
Cited alongside, same era.
Product quantization for nearest neighbor search
H. Jégou, M. Douze, and C. Schmid · 2011
Cited alongside, same era.
Hashing with graphs
W. Liu, J. Wang, S. Kumar, and S. Chang · 2011
Cited alongside, same era.
Atlas: a probabilistic algorithm for high dimensional similarity search
J. Zhai, Y. Lou, and J. Gehrke · 2011
Cited alongside, same era.
The inverted multi-index
A. Babenko and V. S. Lempitsky · 2012
Cited alongside, same era.
Practical and optimal LSH for angular distance
A. Andoni, P. Indyk, T. Laarhoven, I. P. Razenshteyn, and L. Schmidt · 2015
Later among the works it cites.
Optimal data-dependent hashing for approximate near neighbors
A. Andoni and I. Razenshteyn · 2015
Later among the works it cites.
Cache locality is not enough: High-performance nearest neighbor search with product quantization fast scan
F. André, A. Kermarrec, and N. L. Scouarnec · 2015
Later among the works it cites.
Annoy at github https://github.com/spotify/annoy , 2015
E. Bernhardsson · 2015
Later among the works it cites.
Selective hashing: Closing the gap between radius search and k-nn search
J. Gao, H. V. Jagadish, B. C. Ooi, and S. Wang · 2015
Later among the works it cites.
Rank-based similarity search: Reducing the dimensional dependence
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Locality-sensitive hashing scheme based on dynamic collision counting
J. Gan, J. Feng, Q. Fang, and W. Ng · 2012
Cited alongside, same era.
On the difficulty of nearest neighbor search
J. He, S. Kumar, and S. Chang · 2012
Cited alongside, same era.
Learning to prune in metric and non-metric spaces
L. Boytsov and B. Naidan · 2013
Cited alongside, same era.
Optimized product quantization
T. Ge, K. He, Q. Ke, and J. Sun · 2014
Cited alongside, same era.
Approximate nearest neighbor algorithm based on navigable small world graphs
Y. Malkov, A. Ponomarenko, A. Logvinov, and V. Krylov · 2014
Cited alongside, same era.
Scalable nearest neighbor algorithms for high dimensional data
M. Muja and D. G. Lowe · 2014
Cited alongside, same era.
M. E. Houle and M. Nett · 2015
Later among the works it cites.
Query-aware locality-sensitive hashing for approximate nearest neighbor search
Q. Huang, J. Feng, Y. Zhang, Q. Fang, and W. Ng · 2015
Later among the works it cites.
Scalable graph hashing with feature transformation
Q. Jiang and W. Li · 2015
Later among the works it cites.
Permutation search methods are efficient, yet faster search is possible
B. Naidan, L. Boytsov, and E. Nyberg · 2015
Later among the works it cites.
Neighbor-sensitive hashing
Y. Park, M. J. Cafarella, and B. Mozafari · 2015
Later among the works it cites.
Benchmarking nearest neighbors https://github.com/erikbern/ann-benchmarks , 2016
E. Bernhardsson · 2016
Closest in time.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Y. A. Malkov and D. A. Yashunin · 2016
Closest in time.
Nearest neighbor search benchmark https://github.com/DBWangGroupUNSW/nns_benchmark , 2016
Y. Sun, W. Wang, Y. Zhang, and W. Li · 2016
Closest in time.
Learning to hash for indexing big data - A survey
J. Wang, W. Liu, S. Kumar, and S. Chang · 2016
Closest in time.