A new perspective of link prediction in complex network for improving reliability

被引:2
作者
Gu, Shuang [1 ]
Li, Keping [1 ]
Yang, Liu [1 ]
机构
[1] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
来源
INTERNATIONAL JOURNAL OF MODERN PHYSICS C | 2021年 / 32卷 / 01期
关键词
Link prediction; complex network; network reliability growth model; improving reliability; PAPR REDUCTION; EVOLUTION; MODEL; PATTERN; SYSTEMS; DESIGN; GRAPH;
D O I
10.1142/S0129183121500066
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Link prediction is an important issue for network evolution. For many real networks, future link prediction is the key to network development. Experience shows that improving reliability is an important trend of network evolution. Therefore, we consider it from a new perspective and propose a method for predicting new links of evolution networks. The proposed network reliability growth (NRG) model comprehensively considers the factors related to network structure, including the degree, neighbor nodes and distance. Our aim is to improve the reliability in link prediction. In experiments, we apply China high-speed railway network, China highway network and scale-free networks as examples. The results show that the proposed method has better prediction performance for different evaluation indexes. Compared with the other methods, such as CN, RA, PA, ACT, CT and NN, the proposed method has large growth rate and makes the reliability reach the maximum at first which save network construction resources, cost and improve efficiency. The proposed method tends to develop the network towards homogeneous network. In real networks, this structure with stronger stability is the goal of network construction. Therefore, our method is the best to improve network reliability quickly and effectively.
引用
收藏
页数:18
相关论文
共 71 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]   A new similarity measure for link prediction based on local structures in social networks [J].
Aghabozorgi, Farshad ;
Khayyambashi, Mohammad Reza .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 501 :12-23
[3]   A Comparative Analysis of Network Dependability, Fault-tolerance, Reliability, Security, and Survivability [J].
Al-Kuwaiti, M. ;
Kyriakopoulos, N. ;
Hussein, S. .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2009, 11 (02) :106-124
[4]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[5]  
[Anonymous], 2015, Sci. China Inf. Sci
[6]  
[Anonymous], 2018, ENTROPY SWITZ, DOI DOI 10.3390/E20050363
[7]   Evolution of the social network of scientific collaborations [J].
Barabási, AL ;
Jeong, H ;
Néda, Z ;
Ravasz, E ;
Schubert, A ;
Vicsek, T .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2002, 311 (3-4) :590-614
[8]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[9]   An evolutionary algorithm approach to link prediction in dynamic social networks [J].
Bliss, Catherine A. ;
Frank, Morgan R. ;
Danforth, Christopher M. ;
Dodds, Peter Sheridan .
JOURNAL OF COMPUTATIONAL SCIENCE, 2014, 5 (05) :750-764
[10]   Link Prediction Approach for Opportunistic Networks Based on Recurrent Neural Network [J].
Cai, Xulin ;
Shu, Jian ;
Al-Kali, Manar .
IEEE ACCESS, 2019, 7 :2017-2025