Fetching the paper…
Reading the bibliography…
Approximate nearest neighbor (ANN) search is a fundamental problem in many areas of data mining, machine learning and computer vision.
Multidimensional binary search trees used for associative searching
J. L. Bentley · 1975
Earlier work this paper cites.
An algorithm for finding best matches in logarithmic expected time
J. H. Friedman, J. L. Bentley, and R. A. Finkel · 1975
Earlier work this paper cites.
A branch and bound algorithm for computing k-nearest neighbors
K. Fukunaga and P. M. Narendra · 1975
Earlier work this paper cites.
Multidimensional divide-and-conquer
J. L. Bentley · 1980
Earlier work this paper cites.
Fast algorithms for the all nearest neighbors problem
K. L. Clarkson · 1983
Earlier work this paper cites.
An o ( n l o g n ) o(nlogn) algorithm for the all-nearest-neighbors problem
P. M. Vaidya · 1989
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.
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.
Approximate nearest neighbors: towards removing the curse of dimensionality
P. Indyk and R. Motwani · 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.
Performance measures for information extraction
J. Makhoul, F. Kubala, R. Schwartz, and R. Weischedel · 2000
Earlier work this paper cites.
Normalized cuts and image segmentation
J. Shi and J. Malik · 2000
Earlier work this paper cites.
Random projection in dimensionality reduction: applications to image and text data
E. Bingham and H. Mannila · 2001
Cited alongside, same era.
Manifold regularization: A geometric framework for learning from labeled and unlabeled examples
M. Belkin, P. Niyogi, and V. Sindhwani · 2006
Cited alongside, same era.
Scalable recognition with a vocabulary tree
D. Nister and H. Stewenius · 2006
Cited alongside, same era.
Paredes, rodrigo and chávez, edgar and figueroa, karina and navarro, gonzalo
P. C. of k-Nearest Neighbor Graphs in Metric Spaces · 2006
Cited alongside, same era.
Random projection trees and low dimensional manifolds
S. Dasgupta and Y. Freund · 2008
Cited alongside, same era.
Optimised kd-trees for fast image descriptor matching
C. Silpa-Anan and R. Hartley · 2008
Cited alongside, same era.
Hashing with graphs
W. Liu, J. Wang, S. Kumar, and S.-F. Chang · 2011
Later among the works it cites.
Iterative quantization: a procrustean approach to learning binary codes for large-scale image retrieval
G. Yunchao, L. Svetlana, G. Albert, and P. Florent · 2011
Later among the works it cites.
Scalable k-nn graph construction for visual descriptors
R. Gan, J. Wang, J. Wang, G. Zeng, Z. Tu, and S. Li · 2012
Later among the works it cites.
Spherical hashing
J. P. Heo, Y. Lee, J. He, S. F. Chang, and S. E. Yoon · 2012
Later among the works it cites.
Complementary projection hashing
Z. Jin, Y. Hu, Y. Lin, D. Zhang, S. Lin, D. Cai, and X. Li · 2013
Later among the works it cites.
Fast knn graph construction with locality sensitive hashing
Y.-m. Zhang, K. Huang, G. Geng, and C.-l. Liu · 2013
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 knn graph construction for high dimensional data via recursive lanczos bisection
J. Chen, H. R. Fang, and Y. Saad · 2009
Cited alongside, same era.
Fast approximate nearest neighbors with automatic algorithm configuration
M. Muja and D. G. Lowe · 2009
Cited alongside, same era.
Spectral hashing
Y. Weiss, A. Torralba, and R. Fergus · 2009
Cited alongside, same era.
Survey of nearest neighbor techniques
N. Bhatia and Vandana · 2010
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.
Fast approximate nearest-neighbor search with k-nearest neighbor graph
K. Hajebi, Y. Abbasi-Yadkori, H. Shahbazi, and H. Zhang · 2011
Cited alongside, same era.
Kgraph, an open source library for k-nn graph construction and nearest neighbor search
W. Dong · 2014
Later among the works it cites.
Fast and accurate hashing via iterative nearest neighbors expansion
Z. Jin, D. Zhang, Y. Hu, S. Lin, D. Cai, and X. He · 2014
Later among the works it cites.
Scalable nearest neighbor algorithms for high dimensional data
M. Muja and D. G. Lowe · 2014
Later among the works it cites.
Hashing for similarity search: A survey
J. Wang, H. T. Shen, J. Song, and J. Ji · 2014
Later among the works it cites.
Efanna : An extremely fast approximate nearest neighbor search algorithm based on knn graph
C. Fu and D. Cai · 2016
Closest in time.
Visualizing large-scale and high-dimensional data
J. Tang, J. Liu, M. Zhang, and Q. Mei · 2016
Closest in time.