Effect of weak ties on degree and H-index in link prediction of complex network

被引:2
作者
Jia, Jianlin [1 ]
Chen, Yanyan [1 ]
Li, Yongxing [2 ]
Li, Tongfei [1 ]
Chen, Ning [1 ]
Zhu, Xuzhen [3 ]
机构
[1] Beijing Univ Technol, Beijing Key Lab Traff Engn, Beijing 100124, Peoples R China
[2] Nanyang Technol Univ, Sch Civil & Environm Engn, 50 Nanyang Ave, Singapore 639798, Singapore
[3] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
来源
MODERN PHYSICS LETTERS B | 2021年 / 35卷 / 18期
关键词
Complex network; link prediction; degree; H-index; weak ties;
D O I
10.1142/S0217984921503012
中图分类号
O59 [应用物理学];
学科分类号
摘要
Link prediction of complex network intends to estimate the probability of existence of links between two nodes. In order to improve link prediction accuracy and fully exploit the potentialities of nodes, many studies focus more on the influence of degree on nodes but less on the hybrid influence of degree and H-index. The nodes with a larger degree have more neighbors, and the nodes with larger H-index have more neighbors of neighbors. Meanwhile, weak ties consisting of neighbors with a small degree have powerful strength of intermediary ability and a high probability of passing similarity. A novel link prediction model is proposed considering the hybrid influence of degree and H-index and weak ties, which is called Hybrid Weak Influence, marked as HWI. After experimenting with nine real datasets, the results show that this method can significantly improve the link prediction accuracy, compared with the empirical methods: Common Neighbors (CN), Resource-Allocation (RA) and Adamic/Adar (AA). Meanwhile, the computation complexity is less than the long path algorithm of LP, SRW, PCEN.
引用
收藏
页数:14
相关论文
共 44 条
[1]   An efficient algorithm for link prediction in temporal uncertain social networks [J].
Ahmed, Nahla Mohamed ;
Chen, Ling .
INFORMATION SCIENCES, 2016, 331 :120-136
[2]   Link creation and information spreading over social and communication ties in an interest-based online social network [J].
Aiello, Luca Maria ;
Barrat, Alain ;
Cattuto, Ciro ;
Schifanella, Rossano ;
Ruffo, Giancarlo .
EPJ DATA SCIENCE, 2012, 1 (01) :1-31
[3]  
[Anonymous], 2015, Sci. China Inf. Sci
[4]   Local Random Quantum Circuits are Approximate Polynomial-Designs [J].
Brandao, Fernando G. S. L. ;
Harrow, Aram W. ;
Horodecki, Michal .
COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2016, 346 (02) :397-434
[5]   Topological structure analysis of the protein-protein interaction network in budding yeast [J].
Bu, DB ;
Zhao, Y ;
Cai, L ;
Xue, H ;
Zhu, XP ;
Lu, HC ;
Zhang, JF ;
Sun, SW ;
Ling, LJ ;
Zhang, N ;
Li, GJ ;
Chen, RS .
NUCLEIC ACIDS RESEARCH, 2003, 31 (09) :2443-2450
[6]   From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks [J].
Cannistraci, Carlo Vittorio ;
Alanis-Lobato, Gregorio ;
Ravasi, Timothy .
SCIENTIFIC REPORTS, 2013, 3
[7]   Hierarchical structure and the prediction of missing links in networks [J].
Clauset, Aaron ;
Moore, Cristopher ;
Newman, M. E. J. .
NATURE, 2008, 453 (7191) :98-101
[8]   Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks [J].
Daminelli, Simone ;
Thomas, Josephine Maria ;
Duran, Claudio ;
Cannistraci, Carlo Vittorio .
NEW JOURNAL OF PHYSICS, 2015, 17
[9]   An efficient link prediction index for complex military organization [J].
Fan, Changjun ;
Liu, Zhong ;
Lu, Xin ;
Xiu, Baoxin ;
Chen, Qing .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 469 :572-587
[10]   Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation [J].
Fouss, Francois ;
Pirotte, Alain ;
Renders, Jean-Michel ;
Saerens, Marco .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (03) :355-369