Fetching the paper…
Reading the bibliography…
Nearest neighbor search has found numerous applications in machine learning, data mining and massive data processing systems.
A. Guttman, “R-trees: A dynamic index structure for spatial searching,” in SIGMOD , 1984, pp. 47–57
1984
Earlier work this paper cites.
F. P. Preparata and M. I. Shamos, Computational Geometry - An Introduction . Springer, 1985
1985
Earlier work this paper cites.
D. W. Dearholt, N. Gonzales, and G. Kurup, “Monotonic search networks for computer vision databases,” in Twenty-Second Asilomar Conference on Signals, Systems and Computers , vol. 2, 1988, pp. 548–553
1988
Earlier work this paper cites.
J. L. Bentley, “K-d trees for semidynamic point sets,” in SoCG , 1990, pp. 187–197
1990
Earlier work this paper cites.
F. Aurenhammer, “Voronoi diagrams - A survey of a fundamental geometric data structure,” ACM Comput. Surv. , vol. 23, no. 3, pp. 345–405, 1991
1991
Earlier work this paper cites.
J. W. Jaromczyk and G. T. Toussaint, “Relative neighborhood graphs and their relatives,” Proceedings of the IEEE , vol. 80, no. 9, pp. 1502–1517, 1992
1992
Earlier work this paper cites.
S. Arya and D. M. Mount, “Approximate nearest neighbor queries in fixed dimensions,” in SODA , 1993, pp. 271–280
1993
Earlier work this paper cites.
N. Katayama and S. Satoh, “The sr-tree: An index structure for high-dimensional nearest neighbor queries,” in SIGMOD . ACM Press, 1997, pp. 369–380
1997
Earlier work this paper cites.
D. J. Watts and S. H. Strogatz, “Collective dynamics of ”small-world” networks,” Nature , vol. 393, pp. 440–442, 1998
1998
Earlier work this paper cites.
R. Weber, H.-J. Schek, and S. Blott, “A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces,” in VLDB . Morgan Kaufmann, 1998, pp. 194–205
1998
Earlier work this paper cites.
G. Navarro, “Searching in metric spaces by spatial approximation,” in SPIRE/CRIWG , 1999, pp. 141–148
1999
Earlier work this paper cites.
K. S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, “When is ”nearest neighbor” meaningful?” in ICDT , 1999, pp. 217–235
1999
Earlier work this paper cites.
J. M. Kleinberg, “Navigation in a small world,” Nature , vol. 406, no. 6798, p. 845, 2000
2000
Earlier work this paper cites.
J. M. Kleinberg, “The small-world phenomenon: an algorithmic perspective,” in STOC , 2000, pp. 163–170
2000
Earlier work this paper cites.
T. B. Sebastian and B. B. Kimia, “Metric-based shape retrieval in large databases,” in ICPR , 2002, pp. 291–296
2002
Earlier work this paper cites.
D. R. Karger and M. Ruhl, “Finding nearest neighbors in growth-restricted metrics,” in STOC , 2002, pp. 741–750
2002
Earlier work this paper cites.
W. G. Aref, A. C. Catlin, J. Fan, A. K. Elmagarmid, M. A. Hammad, I. F. Ilyas, M. S. Marzouk, and X. Zhu, “A video database management system for advancing video database research,” in Multimedia Information Systems , 2002, pp. 8–17
2002
Earlier work this paper cites.
R. Fagin, R. Kumar, and D. Sivakumar, “Efficient similarity search and classification via rank aggregation,” in SIGMOD , 2003, pp. 301–312
2003
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 SoCG , 2004, pp. 253–262
2004
Earlier work this paper cites.
Y. Ke, R. Sukthankar, and L. Huston, “An efficient parts-based near-duplicate and sub-image retrieval system,” in ACM Multimedia , 2004, pp. 869–876
2004
Earlier work this paper cites.
R. Paredes and E. Chávez, “Using the k -nearest neighbor graph for proximity searching in metric spaces,” in SPIRE , 2005, pp. 127–138
2005
Cited alongside, same era.
M. Bawa, T. Condie, and P. Ganesan, “LSH forest: self-tuning indexes for similarity search,” in WWW , 2005, pp. 651–660
2005
Cited alongside, same era.
D. François, V. Wertz, and M. Verleysen, “The concentration of fractional distances,” IEEE Trans. Knowl. Data Eng. , vol. 19, no. 7, pp. 873–886, 2007
2007
Cited alongside, same era.
Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, “Multi-probe lsh: Efficient indexing for high-dimensional similarity search,” in VLDB , 2007, pp. 950–961
2007
Cited alongside, same era.
Y. Tao, K. Yi, C. Sheng, and P. Kalnis, “Quality and efficiency in high dimensional nearest neighbor search,” in SIGMOD , 2009, pp. 563–576
2009
J. Gao, H. V. Jagadish, B. C. Ooi, and S. Wang, “Selective hashing: Closing the gap between radius search and k-nn search,” in SIGKDD , 2015, pp. 349–358
2015
Later among the works it cites.
A. Babenko and V. Lempitsky, “Tree quantization for large-scale similarity search and classification,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2015, pp. 4240–4248
2015
Later among the works it cites.
2016
Later among the works it cites.
B. Harwood and T. Drummond, “FANNG: fast approximate nearest neighbour graphs,” in CVPR , 2016, pp. 5713–5722
2016
Later among the works it cites.
M. Iwasaki, “Pruned bi-directed k-nearest neighbor graph for proximity search,” in SISAP , vol. 9939, 2016, pp. 20–33
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
M. Newman, Networks: An Introduction . Oxford University Press, 2010
2010
Cited alongside, same era.
H. Jégou, M. Douze, and C. Schmid, “Product quantization for nearest neighbor search,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 33, no. 1, pp. 117–128, 2011
2011
Cited alongside, same era.
K. Hajebi, Y. Abbasi-Yadkori, H. Shahbazi, and H. Zhang, “Fast approximate nearest-neighbor search with k-nearest neighbor graph,” in IJCAI , 2011, pp. 1312–1317
2011
Cited alongside, same era.
K. Aoyama, K. Saito, H. Sawada, and N. Ueda, “Fast approximate similarity search based on degree-reduced neighborhood graphs,” in SIGKDD , 2011, pp. 1055–1063
2011
Cited alongside, same era.
J. Wang and S. Li, “Query-driven iterated neighborhood graph search for large scale indexing,” in ACM MM , 2012, pp. 179–188
2012
Cited alongside, same era.
J. He, S. Kumar, and S.-F. Chang, “On the difficulty of nearest neighbor search,” in ICML , 2012, pp. 1127–1134
2012
Cited alongside, same era.
M. E. Houle, H. Kashima, and M. Nett, “Generalized expansion dimension,” in ICDM Workshops , 2012, pp. 587–594
2012
Cited alongside, same era.
2016
Later among the works it cites.
2016
Later among the works it cites.
A. Andoni, T. Laarhoven, I. P. Razenshteyn, and E. Waingarten, “Optimal hashing-based time-space trade-offs for approximate near neighbors,” in SODA , 2017, pp. 47–66
2017
Later among the works it cites.
M. Douze, A. Sablayrolles, and H. Jégou, “Link and code: Fast indexing with graphs and compact regression codes,” in CVPR , 2018, pp. 3646–3654
2018
Later among the works it cites.
S. Morozov and A. Babenko, “Non-metric similarity graphs for maximum inner product search,” in NIPS , 2018, pp. 4726–4735
2018
Later among the works it cites.
2018
Later among the works it cites.
C. Fu, C. Xiang, C. Wang, and D. Cai, “Fast approximate nearest neighbor search with the navigating spreading-out graph,” Proc. VLDB Endow. , vol. 12, no. 5, pp. 461–474, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
D. Baranchuk, D. Persiyanov, A. Sinitsin, and A. Babenko, “Learning to route in similarity graphs,” in ICML , vol. 97, 2019, pp. 475–484
2019
Later among the works it cites.
Z. Zhou, S. Tan, Z. Xu, and P. Li, “Möbius transformation for fast inner product search on graph,” in NeurIPS , 2019, pp. 8216–8227
2019
Later among the works it cites.
P. Ram and K. Sinha, “Revisiting kd-tree for nearest neighbor search,” in KDD , 2019, pp. 1378–1388
2019
Later among the works it cites.
Y. Dong, P. Indyk, I. P. Razenshteyn, and T. Wagner, “Learning space partitions for nearest neighbor search,” in ICLR , 2020
2020
Closest in time.
Y. A. Malkov and D. A. Yashunin, “Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 42, no. 4, pp. 824–836, 2020
2020
Closest in time.
M. Aumüller, E. Bernhardsson, and A. J. Faithfull, “Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms,” Inf. Syst. , vol. 87, 2020
2020
Closest in time.
Y. Zheng, Q. Guo, A. K. H. Tung, and S. Wu, “Lazylsh: Approximate nearest neighbor search for multiple distance functions with a single index,” in SIGMOD , 2016, pp. 2023–2037
2037
Closest in time.