Fetching the paper…
Reading the bibliography…
Recently, graph based nearest neighbor search gets more and more popular on large-scale retrieval tasks.
1904
Earlier work this paper cites.
J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Communications of ACM
1975
Earlier work this paper cites.
A. Guttman, “R-trees: A dynamic index structure for spatial searching,” in Proceedings of the 1984 ACM SIGMOD international conference on Management of data
1984
Earlier work this paper cites.
M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, “Locality-sensitive hashing scheme based on p-stable distributions,” in Proceedings of the Twentieth Annual Symposium on Computational Geometry
2004
Earlier work this paper cites.
M. Datar, P. Indyk, N. Immorlica, and V. S. Mirrokni, “Locality-sensitive hashing scheme based on p-stable distributions,” in Twentieth Symposium on Computational Geometry
2004
Earlier work this paper cites.
E. Levina and P. J. Bickel, “Maximum likelihood estimation of intrinsic dimension,” Advances in Neural Information Processing Systems
2005
Earlier work this paper cites.
C. Silpa-Anan and R. Hartley, “Optimised kd-trees for fast image descriptor matching,” in CVPR
2008
Earlier work this paper cites.
H. Jégou, M. Douze, and C. Schmid, “Product quantization for nearest neighbor search,” Trans. PAMI
2011
Cited alongside, same era.
W. Dong, C. Moses, and K. Li, “Efficient k-nearest neighbor graph construction for generic similarity measures,” in Proceedings of the 20th International Conference on World Wide Web
2011
Cited alongside, same era.
K. Hajebi, Y. Abbasi-Yadkor, H. Shahbazi, and H. Zhang, “Fast approximate nearest-neighbor search with k-nearest neighbor graph,” in International Joint Conference on Artificial Intelligence
2011
Cited alongside, same era.
W. Liu, J. Wang, R. Ji, Y. G. Jiang, and S. F. Chang, “Supervised hashing with kernels,” in CVPR
2012
Cited alongside, same era.
Y. A. Malkov, A. Ponomarenko, A. Lovinov, and V. Krylov, “Approximate nearest neighbor algorithm based on navigable small world graphs,” Information Systems
2013
B. Naidan, L. Boytsov, and E. Nyberg, “Permutation search methods are efficient, yet faster search is possible,” Proceedings of the Vldb Endowment
2015
Later among the works it cites.
A. Babenko and V. Lempitsky, “Efficient indexing of billion-scale datasets of deep descriptors,” in CVPR
2016
Later among the works it cites.
E. Bernhardsson, “Annoy: approximate nearest neighbors in c++/python optimized for memory usage and loading/saving to disk,” 2016
2016
Later among the works it cites.
B. Harwood and T. Drummond, “FANNG: Fast approximate nearest neighbour graphs,” in CVPR
2016
Later among the works it cites.
Y. A. Malkov and D. A. Yashunin, “Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs,” Trans. PAMI
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…
Cited alongside, same era.
M. Muja and D. G. Lowe, “Scalable nearest neighbor algorithms for high dimensional data,” Trans. PAMI
2014
Cited alongside, same era.
Y. Sun, W. Wang, J. Qin, Y. Zhang, and X. Lin, “SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny,” in The Proceedings of the VLDB Endowment
2014
Cited alongside, same era.
W. Li, Y. Zhang, Y. Sun, W. Wang, W. Zhang, and X. Lin, “Approximate nearest neighbor search on high dimensional data-experiments, analysis and improvement,” IEEE Transactions on Knowledge and Data Engineering
2019
Closest in time.