A survey on feature extraction and learning techniques for link prediction in homogeneous and heterogeneous complex networks

被引:1
作者
Kapoor, Puneet [1 ]
Kaushal, Sakshi [1 ]
Kumar, Harish [1 ]
Kanwar, Kushal [2 ]
机构
[1] Panjab Univ, Univ Inst Engn & Technol, Chandigarh 160014, India
[2] Jaypee Univ Informat Technol, Solan 173215, Himachal Prades, India
关键词
Complex networks; Link prediction; Graph neural networks; Feature learning; Predictive analytics; GRAPH; MODELS;
D O I
10.1007/s10462-024-10998-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Complex networks are commonly observed in several real-world areas, such as social, biological, and technical systems, where they exhibit complicated patterns of connectedness and organised clusters. These networks have intricate topological characteristics that frequently elude conventional characterization. Link prediction in complex networks, like data flow in telecommunications networks, protein interactions in biological systems, and social media interactions on platforms like Facebook, etc., is an essential element of network analytics and presents fresh research challenges. Consequently, there is a growing emphasis in research on creating new link prediction methods for different network applications. This survey investigates several strategies related to link prediction, ranging from feature extraction based to feature learning based techniques, with a specific focus on their utilisation in dynamic and developing network topologies. Furthermore, this paper emphasises on a wide variety of feature learning techniques that go beyond basic feature extraction and matrix factorization. It includes advanced learning-based algorithms and neural network techniques specifically designed for link prediction. The study also presents evaluation results of different link prediction techniques on homogeneous and heterogeneous network datasets, and provides a thorough examination of existing methods and potential areas for further investigation.
引用
收藏
页数:93
相关论文
共 145 条
  • [1] Al Hasan M., 2006, P SDM06 WORKSH LINK, V30, P798, DOI [DOI 10.1016/J.ISCI.2020.101626, 10.1016/j.isci.2020.101626]
  • [2] [Anonymous], 2007, Probabilistic Matrix Factorization. In Advances in Neural Information Processing Systems, DOI DOI 10.5555/2981562.2981720
  • [3] Balvir SU, 2023, 2023 6 INT C INF SYS, P1, DOI [10.1109/ISCON57294.2023.10112010, DOI 10.1109/ISCON57294.2023.10112010]
  • [4] A Survey on Embedding Dynamic Graphs
    Barros, Claudio D. T.
    Mendonca, Matheus R. F.
    Vieira, Alex B.
    Ziviani, Artur
    [J]. ACM COMPUTING SURVEYS, 2023, 55 (01)
  • [5] Bastos A, 2023, ACM WEB C 2023 P WOR, P2455, DOI [10.1145/3543507.3583308, DOI 10.1145/3543507.3583308]
  • [6] WSNMF: Weighted Symmetric Nonnegative Matrix Factorization for attributed graph clustering
    Berahmand, Kamal
    Mohammadi, Mehrnoush
    Sheikhpour, Razieh
    Li, Yuefeng
    Xu, Yue
    [J]. NEUROCOMPUTING, 2024, 566
  • [7] Heterogeneous graph neural networks analysis: a survey of techniques, evaluations and applications
    Bing, Rui
    Yuan, Guan
    Zhu, Mu
    Meng, Fanrong
    Ma, Huifang
    Qiao, Shaojie
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2023, 56 (08) : 8003 - 8042
  • [8] Bordes A., 2013, Advances in neural information processing systems, V26, P2787
  • [9] The anatomy of a large-scale hypertextual Web search engine
    Brin, S
    Page, L
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 107 - 117
  • [10] A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
    Cai, HongYun
    Zheng, Vincent W.
    Chang, Kevin Chen-Chuan
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (09) : 1616 - 1637