Fetching the paper…
Reading the bibliography…
Graph search is one of the most successful algorithmic trends in near neighbor search.
A comparative study on hierarchical navigable small world graphs
Lin, P.-C. and Zhao, W.-L · 1904
Earlier work this paper cites.
Graph based nearest neighbor search: Promises and failures
Lin, P.-C. and Zhao, W.-L · 1904
Earlier work this paper cites.
Reducing the bandwidth of sparse symmetric matrices
Cuthill, E. and McKee, J · 1969
Earlier work this paper cites.
Computer implementation of the finite element method
George, J. A · 1971
Earlier work this paper cites.
Approximate nearest neighbor queries in fixed dimensions
Arya, S. and Mount, D. M · 1993
Earlier work this paper cites.
Object recognition from local scale-invariant features
Lowe, D. G · 1999
Earlier work this paper cites.
Closest-point problems simplified on the ram
Chan, T. M · 2002
Earlier work this paper cites.
Metric-based shape retrieval in large databases
Sebastian, T. B. and Kimia, B. B · 2002
Earlier work this paper cites.
Cover trees for nearest neighbor
Beygelzimer, A., Kakade, S., and Langford, J · 2006
Earlier work this paper cites.
Nearest-neighbor methods in learning and vision
Shakhnarovich, G., Darrell, T., and Indyk, P · 2008
Earlier work this paper cites.
On compressing social networks
Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., and Raghavan, P · 2009
Earlier work this paper cites.
Fast construction of k-nearest neighbor graphs for point clouds
Connor, M. and Kumar, P · 2010
Earlier work this paper cites.
Product quantization for nearest neighbor search
Jegou, H., Douze, M., and Schmid, C · 2010
Earlier work this paper cites.
Efficient k-nearest neighbor graph construction for generic similarity measures
Dong, W., Moses, C., and Li, K · 2011
Earlier work this paper cites.
Multiscale approach for the network compression-friendly ordering
Safro, I. and Temkin, B · 2011
Cited alongside, same era.
Engineering efficient and effective non-metric space library
Boytsov, L. and Naidan, B · 2013
Cited alongside, same era.
Devise: a deep visual-semantic embedding model
Frome, A., Corrado, G. S., Shlens, J., Bengio, S., Dean, J., Ranzato, M., and Mikolov, T · 2013
Cited alongside, same era.
Learning deep structured semantic models for web search using clickthrough data
Huang, P.-S., He, X., Gao, J., Deng, L., Acero, A., and Heck, L · 2013
Cited alongside, same era.
Distributed representations of words and phrases and their compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G. S., and Dean, J · 2013
Cited alongside, same era.
Approximate nearest neighbor algorithm based on navigable small world graphs
Malkov, Y., Ponomarenko, A., Logvinov, A., and Krylov, V · 2014
Graph-based time-space trade-offs for approximate near neighbors
Laarhoven, T · 2017
Later among the works it cites.
Making caches work for graph analytics
Zhang, Y., Kiriansky, V., Mendis, C., Amarasinghe, S., and Zaharia, M · 2017
Later among the works it cites.
When is graph reordering an optimization? studying the effect of lightweight graph reordering across applications and input graphs
Balaji, V. and Lucia, B · 2018
Later among the works it cites.
Iwasaki, M. and Miyazaki, D · 2018
Later among the works it cites.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Malkov, Y. A. and Yashunin, D. A · 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.
Reordering very large graphs for fun & profit
Auroux, L., Burelle, M., and Erra, R · 2015
Cited alongside, same era.
From word embeddings to document distances
Kusner, M. J., Sun, Y., Kolkin, N. I., and Weinberger, K. Q · 2015
Cited alongside, same era.
Non-metric space library manual
Naidan, B., Boytsov, L., Malkov, Y., and Novak, D · 2015
Cited alongside, same era.
Fanng: Fast approximate nearest neighbour graphs
Harwood, B. and Drummond, T · 2016
Cited alongside, same era.
Pruned bi-directed k-nearest neighbor graph for proximity search
Iwasaki, M · 2016
Cited alongside, same era.
Mash: fast genome and metagenome distance estimation using minhash
Ondov, B. D., Treangen, T. J., Melsted, P., Mallonee, A. B., Bergman, N. H., Koren, S., and Phillippy, A. M · 2016
Cited alongside, same era.
A closer look at lightweight graph reordering
Faldu, P., Diamond, J., and Grot, B · 2019
Later among the works it cites.
Billion-scale similarity search with gpus
Johnson, J., Douze, M., and Jégou, H · 2019
Later among the works it cites.
Semantic product search
Nigam, P., Song, Y., Mohan, V., Lakshman, V., Ding, W., Shingavi, A., Teo, C. H., Gu, H., and Yin, B · 2019
Later among the works it cites.
Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
Aumüller, M., Bernhardsson, E., and Faithfull, A · 2020
Later among the works it cites.
Learning space partitions for nearest neighbor search
Dong, Y., Indyk, P., Razenshteyn, I. P., and Wagner, T · 2020
Later among the works it cites.
Graph-based nearest neighbor search: From practice to theory
Prokhorenkova, L. and Shekhovtsov, A · 2020
Later among the works it cites.
A survey on graph-based methods for similarity searches in metric spaces
Shimomura, L. C., Oyamada, R. S., Vieira, M. R., and Kaster, D. S · 2020
Later among the works it cites.
A survey on locality sensitive hashing algorithms and their applications
Jafari, O., Maurya, P., Nagarkar, P., Islam, K. M., and Crushev, C · 2021
Closest in time.