Temporal link prediction based on node dynamics

被引:4
|
作者
Wu, Jiayun [1 ]
He, Langzhou [1 ]
Jia, Tao [1 ]
Tao, Li [1 ]
机构
[1] Southwest Univ, Coll Comp & Informat Sci, Chongqing 400715, Peoples R China
关键词
Temporal network; Link prediction; Node dynamics; Network evolution; Interpretability; NETWORKS; PREDICTABILITY;
D O I
10.1016/j.chaos.2023.113402
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Temporal link prediction (TLP) aims to predict future links and is attracting increasing attention. The diverse interaction patterns and nonlinear nature of temporal networks make it challenging to design high-accuracy general prediction algorithms. Black-box models such as network embeddings and graph neural networks have gradually become the mainstream for TLP, mainly due to their high prediction accuracy. However, a good TLP algorithm also needs to assist us in exploring the network evolution mechanism. Accuracy-oriented black-box methods cannot sufficiently explain the evolution mechanism because of their low interpretability. Hence there is a need for a high-accuracy white-box TLP method. In this paper, we turn the perspective of link prediction to node itself, a more microscopic level whose dynamic nature we take to predict future links. Two dynamic properties - node activity and node loyalty - are extracted and quantified. Activity is the basic ability of a node to obtain links, and loyalty is its ability to maintain its current link state. Based on the above two properties, we propose a Develop-Maintain Activity Backbone (DMAB) model as our TLP algorithm. Comparative experiments with six state-of-the-art black-box methods on 12 real networks illustrate that DMAB has excellent prediction performance and well captures network evolution mechanisms.
引用
收藏
页数:11
相关论文
共 50 条
  • [21] Distributed temporal link prediction algorithm based on label propagation
    Xu, Xiaolong
    Hu, Nan
    Li, Tao
    Trovati, Marcello
    Palmieri, Francesco
    Kontonatsios, Georgios
    Castiglione, Aniello
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 93 : 627 - 636
  • [22] Link Prediction for Wikipedia Articles based on Temporal Article Embedding
    Ma, Jiaji
    Iwaihara, Mizuho
    PROCEEDINGS OF THE 13TH INTERNATIONAL JOINT CONFERENCE ON KNOWLEDGE DISCOVERY, KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT (KDIR), VOL 1:, 2021, : 87 - 94
  • [23] Link Prediction for Temporal Heterogeneous Networks Based on the Information Lifecycle
    Cao, Jiaping
    Li, Jichao
    Jiang, Jiang
    MATHEMATICS, 2023, 11 (16)
  • [24] Temporal link prediction based on dynamic heterogeneous information network
    Zhao, Zeya
    Jia, Yantao
    Wang, Yuanzhuo
    Jin, Xiaolong
    Cheng, Xueqi
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2015, 52 (08): : 1735 - 1741
  • [25] A Link Prediction Approach in Temporal Networks Based on Game Theory
    Liu L.
    Wang Y.
    Ni Q.
    Cao J.
    Bu Z.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2019, 56 (09): : 1953 - 1964
  • [26] Dynamic Network Link Prediction Based on Node Representation and Subgraph Structure
    Hao, Xiaorong
    Wang, Li
    Lian, Tao
    Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence, 2021, 34 (02): : 117 - 126
  • [27] NodeSim: node similarity based network embedding for diverse link prediction
    Akrati Saxena
    George Fletcher
    Mykola Pechenizkiy
    EPJ Data Science, 11
  • [28] Accurate similarity index based on activity and connectivity of node for link prediction
    Li, Longjie
    Qian, Lvjian
    Wang, Xiaoping
    Luo, Shishun
    Chen, Xiaoyun
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2015, 29 (17):
  • [29] Link prediction of time-evolving network based on node ranking
    Wu, Xiaomin
    Wu, Jianshe
    Li, Yafeng
    Zhang, Qian
    KNOWLEDGE-BASED SYSTEMS, 2020, 195
  • [30] An Efficient Link Prediction Technique in Social Networks based on Node Neighborhoods
    Nandi, Gypsy
    Das, Anjan
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2018, 9 (06) : 257 - 266