Fetching the paper…
Reading the bibliography…
As research interest surges, vector similarity search is applied in multiple fields, including data mining, computer vision, and information retrieval.
G. T. Toussaint, “The relative neighbourhood graph of a finite planar set,” Pattern recognition , vol. 12, no. 4, pp. 261–268, 1980
1980
Earlier work this paper cites.
K. Onishi and N. Takayama, “Construction of voronoi diagram on the upper half-plane,” Transactions on Fundamentals of Electronics, Communications and Computer Sciences , vol. 79, no. 4, pp. 533–539, 1996
1996
Earlier work this paper cites.
A. Gionis, P. Indyk, and R. Motwani, “Similarity search in high dimensions via hashing,” in VLDB , 1999, pp. 518–529
1999
Earlier work this paper cites.
C. Silpa-Anan and R. I. Hartley, “Optimised kd-trees for fast image descriptor matching,” in CVPR , 2008
2008
Earlier work this paper cites.
Z. Sun and T. Tan, “Ordinal measures for iris recognition,” TPAMI , vol. 31, no. 12, pp. 2211–2226, 2008
2008
Earlier work this paper cites.
H. Jégou, M. Douze, and C. Schmid, “Product quantization for nearest neighbor search,” TPAMI , vol. 33, no. 1, pp. 117–128, 2011
2011
Earlier work this paper cites.
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
Earlier work this paper cites.
T. Skopal and B. Bustos, “On nonmetric similarity search problems in complex domains,” ACM Computing Surveys (CSUR) , vol. 43, no. 4, pp. 1–50, 2011
2011
Earlier work this paper cites.
W. Dong, M. Charikar, and K. Li, “Efficient k-nearest neighbor graph construction for generic similarity measures,” in WWW , 2011, pp. 577–586
2011
Earlier work this paper cites.
J. Wang, J. Wang, G. Zeng, Z. Tu, R. Gan, and S. Li, “Scalable k-nn graph construction for visual descriptors,” in CVPR , 2012, pp. 1106–1113
2012
Earlier work this paper cites.
Q. Huang, J. Mao, and Y. Liu, “An improved grid search algorithm of svr parameters optimization,” in ICCT , 2012, pp. 1022–1026
2012
Earlier work this paper cites.
P. Bose, V. Dujmović, F. Hurtado, J. Iacono, S. Langerman, H. Meijer, V. Sacristán, M. Saumell, and D. R. Wood, “Proximity graphs: E, δ \delta , δ \delta , χ \chi and ω \omega ,” International Journal of Computational Geometry & Applications , vol. 22, no. 05, pp. 439–469, 2012
2012
Earlier work this paper cites.
M. E. Houle and M. Nett, “Rank-based similarity search: Reducing the dimensional dependence,” TPAMI , vol. 37, no. 1, pp. 136–150, 2014
2014
Earlier work this paper cites.
Y. Malkov, A. Ponomarenko, A. Logvinov, and V. Krylov, “Approximate nearest neighbor algorithm based on navigable small world graphs,” Information Systems , vol. 45, pp. 61–68, 2014
2014
Earlier work this paper cites.
M. Muja and D. G. Lowe, “Scalable nearest neighbor algorithms for high dimensional data,” TPAMI , vol. 36, no. 11, pp. 2227–2240, 2014
2014
Earlier work this paper cites.
Q. Huang, J. Feng, Y. Zhang, Q. Fang, and W. Ng, “Query-aware locality-sensitive hashing for approximate nearest neighbor search,” PVLDB , vol. 9, no. 1, pp. 1–12, 2015
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
F. André, A. Kermarrec, and N. L. Scouarnec, “Cache locality is not enough: High-performance nearest neighbor search with product quantization fast scan,” PVLDB , vol. 9, no. 4, pp. 288–299, 2015
2015
Earlier work this paper cites.
Yahoo, “Nearest neighbor search with neighborhood graph and tree for high-dimensional data,” https://github.com/yahoojapan/NGT, 2016
2016
Earlier work this paper cites.
A. Boutet, A. Kermarrec, N. Mittal, and F. Taïani, “Being prepared in a sparse world: The case of KNN graph construction,” in ICDE , 2016, pp. 241–252
2016
Earlier work this paper cites.
G. Valkanas, T. Lappas, and D. Gunopulos, “Mining competitors from large unstructured datasets,” TKDE , vol. 29, no. 9, pp. 1971–1984, 2017
2017
Earlier work this paper cites.
X. Huang, J. Li, and X. Hu, “Label informed attributed network embedding,” in WSDM , 2017, pp. 731–739
2017
Earlier work this paper cites.
J. Li, H. Liu, C. Gui, J. Chen, Z. Ni, N. Wang, and Y. Chen, “The design and implementation of a real time visual search system on JD e-commerce platform,” in Proceedings of the 19th International Middleware Conference , 2018, pp. 9–16
2018
Cited alongside, same era.
Facebook, “A library for efficient similarity search and clustering of dense vectors,” https://github.com/facebookresearch/faiss, 2018
2018
Cited alongside, same era.
E. Bernhardsson, M. Aumüller, and A. Faithfull, “Benchmarking nearest neighbors,” https://github.com/erikbern/ann-benchmarks, 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
W. Yang, T. Li, G. Fang, and H. Wei, “Pase: Postgresql ultra-high-dimensional approximate nearest neighbor search extension,” in SIGMOD , 2020, p. 2241–2253
2020
Later among the works it cites.
Jingdong, “A distributed system for embedding-based retrieval,” https://github.com/vearch/vearch, 2020
2020
Later among the works it cites.
Microsoft, “Sptag: A library for fast approximate nearest neighbor search,” https://github.com/microsoft/SPTAG, 2020
2020
Later among the works it cites.
W. Li, Y. Zhang, Y. Sun, W. Wang, M. Li, W. Zhang, and X. Lin, “Approximate nearest neighbor search on high dimensional data - experiments, analyses, and improvement,” TKDE , vol. 32, no. 8, pp. 1475–1488, 2020
2020
Later among the works it cites.
K. Echihabi, “High-dimensional vector similarity search: From time series to deep network embeddings,” in SIGMOD , 2020, pp. 2829–2832
2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. C. Shimomura, M. R. Vieira, and D. S. Kaster, “Performance analysis of graph-based methods for exact and approximate similarity search in metric spaces,” in International Conference on Similarity Search and Applications , 2018, pp. 18–32
2018
Cited alongside, same era.
A. Arora, S. Sinha, P. Kumar, and A. Bhattacharya, “Hd-index: Pushing the scalability-accuracy boundary for approximate knn search in high-dimensional spaces,” PVLDB , vol. 11, no. 8, pp. 906–919, 2018
2018
Cited alongside, same era.
K. Echihabi, K. Zoumpatianos, T. Palpanas, and H. Benbrahim, “Return of the lernaean hydra: Experimental evaluation of data series approximate similarity search,” PVLDB , vol. 13, no. 3, pp. 403–420, 2019
2019
Cited alongside, same era.
T. King, “80 percent of your data will be unstructured in five years,” https://solutionsreview.com/data-management/80-percent-of-your-data-will-be-unstructured-in-five-years/, 2019
2019
Cited alongside, same era.
C. Fu, C. Xiang, C. Wang, and D. Cai, “Fast approximate nearest neighbor search with the navigating spreading-out graph,” PVLDB , vol. 12, no. 5, pp. 461–474, 2019
2019
Cited alongside, same era.
N. Vo, L. Jiang, C. Sun, K. Murphy, L. Li, L. Fei-Fei, and J. Hays, “Composing text and image for image retrieval - an empirical odyssey,” in CVPR , 2019, pp. 6439–6448
2019
Cited alongside, same era.
Milvus, “The world’s most advanced open-source vector database,” https://github.com/milvus-io/milvus, 2019
2019
Cited alongside, same era.
S. Xu, L. Shang, and F. Shen, “Latent semantics encoding for label distribution learning,” in IJCAI , 2019, pp. 3982–3988
2019
Cited alongside, same era.
Later among the works it cites.
R. Guo, P. Sun, E. Lindgren, Q. Geng, D. Simcha, F. Chern, and S. Kumar, “Accelerating large-scale inference with anisotropic vector quantization,” in ICML , 2020, pp. 3887–3896
2020
Later among the works it cites.
L. Gong, H. Wang, M. Ogihara, and J. Xu, “idec: Indexable distance estimating codes for approximate nearest neighbor search,” PVLDB , vol. 13, no. 9, pp. 1483–1497, 2020
2020
Later among the works it cites.
Z. Zhang, F. Zhuang, H. Zhu, Z. Shi, H. Xiong, and Q. He, “Relational graph neural network with hierarchical attention for knowledge graph completion,” in AAAI , 2020, pp. 9612–9619
2020
Later among the works it cites.
A. V. Kannan, D. Fradkin, I. Akrotirianakis, T. Kulahcioglu, A. Canedo, A. Roy, S. Yu, A. V. Malawade, and M. A. A. Faruque, “Multimodal knowledge graph for deep learning papers and code,” in CIKM , 2020, pp. 3417–3420
2020
Later among the works it cites.
W. Zhao, S. Tan, and P. Li, “SONG: approximate nearest neighbor search on GPU,” in ICDE , 2020, pp. 1033–1044
2020
Later among the works it cites.
C. Li, M. Zhang, D. G. Andersen, and Y. He, “Improving approximate nearest neighbor search through learned adaptive early termination,” in SIGMOD , 2020, pp. 2539–2554
2020
Later among the works it cites.
J. Ren, M. Zhang, and D. Li, “HM-ANN: efficient billion-point nearest neighbor search on heterogeneous memory,” in NeurIPS , 2020
2020
Later among the works it cites.
M. Li, Y. Zhang, Y. Sun, W. Wang, I. W. Tsang, and X. Lin, “I/O efficient approximate nearest neighbour search based on learned functions,” in ICDE , 2020, pp. 289–300
2020
Later among the works it cites.
J. Wang, X. Yi, R. Guo, H. Jin, P. Xu, S. Li, X. Wang, X. Guo, C. Li, X. Xu, K. Yu, Y. Yuan, Y. Zou, J. Long, Y. Cai, Z. Li, Z. Zhang, Y. Mo, J. Gu, R. Jiang, Y. Wei, and C. Xie, “Milvus: A purpose-built vector data management system,” in SIGMOD , 2021, pp. 2614–2627
2021
Later among the works it cites.
C. Fu, C. Wang, and D. Cai, “High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility,” TPAMI , 2021
2021
Later among the works it cites.
J. Qin, W. Wang, C. Xiao, Y. Zhang, and Y. Wang, “High-dimensional similarity query processing for data science,” in SIGKDD , 2021, pp. 4062–4063
2021
Later among the works it cites.
M. Wang, X. Xu, Q. Yue, and Y. Wang, “A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search,” PVLDB , vol. 14, no. 11, pp. 1964–1978, 2021
2021
Later among the works it cites.
K. Echihabi, K. Zoumpatianos, and T. Palpanas, “High-dimensional similarity search for scalable data science,” in ICDE , 2021, pp. 2369–2372
2021
Later among the works it cites.
2021
Later among the works it cites.
W.-L. Zhao, H. Wang, and C.-W. Ngo, “Approximate k-nn graph construction: A generic online approach,” IEEE Transactions on Multimedia , 2021
2021
Later among the works it cites.
X. Xu, M. Wang, Y. Wang, and D. Ma, “Two-stage routing with optimized guided search and greedy algorithm on proximity graph,” Knowledge-Based Systems , p. 107305, 2021
2021
Later among the works it cites.
Anonymous, “Academic expert finding via ( k , 𝒫 ) (k,\mathcal{P}) -core based embedding over heterogeneous graphs,” 2021, accepted by ICDE 2022 (Early Notification)
2022
Closest in time.