1. Chen, G., Xu, C., Wang, J., Feng, J., Feng, J.: Nonnegative matrix factorization for link prediction in directed complex networks using PageRank and asymmetric link clustering information. Expert Syst. Appl.148, 113290 (2020)

   Article  Google Scholar 

2. Dong, W., Charikar, M., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web, pp. 577–586 (2011)

   Google Scholar 

3. Fu, C., Wang, C., Cai, D.: High dimensional similarity search with satellite system graph: efficiency, scalability, and unindexed query compatibility. IEEE Trans. Pattern Anal. Mach. Intell., 1 (2021)

   Google Scholar 

4. Fu, C., Xiang, C., Wang, C., Cai, D.: Fast approximate nearest neighbor search with the navigating spreading-out graphs. PVLDB12(5), 461–474 (2019)

   Google Scholar 

5. Harwood, B., Drummond, T.: FANNG: fast approximate nearest neighbour graphs. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 5713–5722 (2016)

   Google Scholar 

6. Levy, O., Goldberg, Y.: Neural word embedding as implicit matrix factorization. In: Advances in Neural Information Processing Systems, vol. 27, pp. 2177–2185 (2014)

   Google Scholar 

7. Liu, X., Murata, T., Kim, K.S., Kotarasu, C., Zhuang, C.: A general view for network embedding as matrix factorization. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 375–383 (2019)

   Google Scholar 

8. Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst.45, 61–68 (2014)

   Article  Google Scholar 

9. Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell.42(4), 824–836 (2020)

   Article  Google Scholar 

10. Naidan, B., Boytsov, L., Nyberg, E.: Permutation search methods are efficient, yet faster search is possible. PVLDB8(12), 1618–1629 (2015)

    Google Scholar 

11. Paredes, R., Chávez, E.: Using thek-nearest neighbor graph for proximity searching in metric spaces. In: Consens, M., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 127–138. Springer, Heidelberg (2005).https://doi.org/10.1007/11575832_14

    Chapter  Google Scholar 

12. Qi, Z., Yue, K., Duan, L., Wang, J., Qiao, S., Fu, X.: Matrix factorization based Bayesian network embedding for efficient probabilistic inferences. Expert Syst. Appl.169, 114294 (2021)

    Article  Google Scholar 

13. Shim, C., Kim, W., Heo, W., Yi, S., Chung, Y.D.: Nearest close friend search in geo-social networks. Inf. Sci.423, 235–256 (2018)

    Article MathSciNet  Google Scholar 

14. Shimomura, L.C., Oyamada, R.S., Vieira, M.R., Kaster, D.S.: A survey on graph-based methods for similarity searches in metric spaces. Inf. Syst.95, 101507 (2021)

    Article  Google Scholar 

15. Symeonidis, P.: Similarity search, recommendation and explainability over graphs in different domains: social media, news, and health industry. In: Brambilla, M., Chbeir, R., Frasincar, F., Manolescu, I. (eds.) ICWE 2021. LNCS, vol. 12706, pp. 537–541. Springer, Cham (2021).https://doi.org/10.1007/978-3-030-74296-6_46

    Chapter  Google Scholar 

16. Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recogn.12(4), 261–268 (1980)

    Article MathSciNet  Google Scholar 

17. Wang, M., Xu, X., Yue, Q., Wang, Y.: A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. PVLDB14(11), 1964–1978 (2021)

    Google Scholar 

18. Zheng, B., et al.: Towards a distributed local-search approach for partitioning large-scale social networks. Inf. Sci.508, 200–213 (2020)

    Article  Google Scholar 

Download references