Link prediction model based on dynamic network representation

被引:1
作者
Han Zhong-Ming [1 ,2 ]
Li Sheng-Nan [1 ]
Zheng Chen-Ye [1 ]
Duan Da-Gao [1 ]
Yang Wei-Jie [1 ]
机构
[1] Beijing Technol & Business Univ, Coll Comp & Informat Engn, Beijing 100048, Peoples R China
[2] Beijing Technol & Business Univ, Beijing Key Lab Food Safety Big Data Technol, Beijing 100048, Peoples R China
关键词
link prediction; dynamic network; representation learning; random walk; GRAPH;
D O I
10.7498/aps.69.20191162
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Link prediction is an important issue in network analysis tasks, which aims at detecting missing, spurious or evolving links in a network, based on the topology information of the network and/or the attributes of the nodes. It has been applied to many real-world applications, such as information integration, social network analysis, recommendation systems, and bioinformatics. Existing link prediction methods focus on static networks and ignore the transmission of dynamic information in the network. However, many graphs in practical applications are dynamic and evolve constantly over time. How to capture time information in a dynamic network and improve the accuracy of link prediction remains a conspicuous challenge. To tackle these challenges, we propose a dynamic network representation based link prediction model, named DNRLP. DNRLP can be mainly divided into two modules: a representation learning module on dynamic network and a link prediction module, where the representation learning module is composed of a node information dynamic update unit and a node neighborhood update unit. Node information dynamic update unit leverages the benefits of the long short-term memory (LSTM) in capturing time information and uses a Time Interval based Filter Unit (TIFU) to introduce time interval information between two links, while for the node neighborhood update unit we present a random walk algorithm based on connection strength to simulate the diffusion of dynamic information. Through the above two parts, the model can obtain the node representation at the new moment, then link prediction is performed by the link prediction module by measuring the similarity between the node representations. The experiment uses MRR and Recall@k indicators to evaluate performance of model on four public dynamic network datasets. The experiments demonstrate the effectiveness and the credibility of the proposed model in link prediction tasks as compared with the comparison models, the MNR index of the DNRLP is increased by 30.8%. The model proposed in this paper not only learns the dynamic information in the network, but also considers its influence on neighbors and the impact of time interval on information update. Therefore, the model has learned more abundant dynamic information and has obvious advantages for link prediction tasks.
引用
收藏
页数:14
相关论文
共 40 条
[1]  
[Anonymous], 2009, IEEE T NEURAL NETWOR, DOI DOI 10.1109/TNN.2008.2005605
[2]  
[Anonymous], 2017, P 26 INT C WORLD, DOI DOI 10.1145/3038912.3052627
[3]  
[Anonymous], 2017, CHINESE PHYS B, DOI DOI 10.1088/1674-1056/26/1/018902
[4]  
[Anonymous], 1997, NEURAL COMPUT
[5]  
[Anonymous], 2009, SCIENCE, DOI DOI 10.1126/SCIENCE.1165821
[6]  
[Anonymous], 2019, IEEE INFOCOM SER
[7]  
[Anonymous], 2007, IEEE T KNOWL DATA EN
[8]  
[Anonymous], 2019, WEB C 2019 P WORLD, DOI DOI 10.1145/3308558.3313620
[9]  
[Anonymous], 2016, KDD16 P 22 ACM, DOI DOI 10.1145/2939672.2939754
[10]  
[Anonymous], 2017, CHIN PHYS B, DOI DOI 10.1088/1674-1056/26/3/038902