Fetching the paper…
Reading the bibliography…
Searching for high-dimensional vector data with high accuracy is an inevitable search technology for various types of data.
Multidimensional binary search trees used for associative searching
J. L. Bentley · 1975
Earlier work this paper cites.
Approximate nearest neighbor queries in fixed dimensions
S. Arya and D. M. Mount · 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.
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu · 1998
Earlier work this paper cites.
Similarity search in high dimensions via hashing
A. Gionis, P. Indyk, and R. Motwani · 1999
Earlier work this paper cites.
Object recognition from local scale-invariant features
D. Lowe · 1999
Earlier work this paper cites.
Modeling the shape of the scene: A holistic representation of the spatial envelope
A. Oliva and A. Torralba · 2001
Earlier work this paper cites.
Metric-based shape retrieval in large databases
T. B. Sebastian and B. B. Kimia · 2002
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
Cited alongside, same era.
Scalable recognition with a vocabulary tree
D. Nister and H. Stewenius · 2006
Cited alongside, same era.
Optimised kd-trees for fast image descriptor matching
C. Silpa-Anan and R. Hartley · 2008
Cited alongside, same era.
Pp-index: Using permutation prefixes for efficient and scalable approximate similarity search
A. Esuli · 2009
Cited alongside, same era.
Spectral hashing
Y. Weiss, A. Torralba, and R. Fergus · 2009
Cited alongside, same era.
Proximity search in metric spaces using approximate k nearest neighbor graph
M. Iwasaki · 2010
Cited alongside, same era.
Fast approximate nearest-neighbor search with k-nearest neighbor graph
K. Hajebi, Y. Abbasi-Yadkori, H. Shahbazi, and H. Zhang · 2011
Later among the works it cites.
Product quantization for nearest neighbor search
H. Jégou, M. Douze, and C. Schmid · 2011
Later among the works it cites.
Query-driven iterated neighborhood graph search for large scale indexing
J. Wang and S. Li · 2012
Later among the works it cites.
Succinct nearest neighbor search
E. S. Tellez, E. Chavez, and G. Navarro · 2013
Later among the works it cites.
Approximate nearest neighbor algorithm based on navigable small world graphs
Y. Malkov, A. Ponomarenko, A. Logvinov, and V. Krylov · 2014
Later among the works it cites.
Scalable nearest neighbor algorithms for high dimensional data
M. Muja and D. Lowe · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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, C. Moses, and K. Li · 2011
Cited alongside, same era.
Iterative quantization: A procrustean approach to learning binary codes
Y. Gong and S. Lazebnik · 2011
Cited alongside, same era.
Pruned bi-directed k-nearest neighbor graph for proximity search
M. Iwasaki · 2016
Later among the works it cites.
Y. A. Malkov and D. A. Yashunin · 2016
Later among the works it cites.
Billion-scale similarity search with gpus
J. Johnson, M. Douze, and H. Jégou · 2017
Later among the works it cites.