Path extension similarity link prediction method based on matrix algebra in directed networks

被引:83
作者
Guo, Feipeng [1 ,2 ]
Zhou, Wei [1 ,2 ]
Lu, Qibei [3 ]
Zhang, Chen [4 ]
机构
[1] Zhejiang Gongshang Univ, Sch Management & Business, Hangzhou 310018, Peoples R China
[2] Zhejiang Gongshang Univ, Modern Business Res Ctr, Hangzhou 310018, Peoples R China
[3] Zhejiang Int Studies Univ, Sch Int Business, Hangzhou 310023, Peoples R China
[4] Hangzhou Gaojin Technol Co Ltd, Hangzhou 310018, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Directed network; Communication network; Link prediction; Matrix algebra; Path extension;
D O I
10.1016/j.comcom.2022.02.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Traditional link prediction methods are generally only calculated for the neighbor information of nodes, and the network path between nodes has not been fully utilized. Therefore, this paper proposes a directed network link prediction method based on path extension similarity to improve the prediction accuracy of potential edges of network nodes. Firstly, the mathematical definition of each local index is expressed in matrix form through matrix algebra; secondly, according to the algorithm principle of global and quasi-local indices, the extension form of local indices is clarified; and the path extension of each local index is carried out respectively; finally, multiple real data sets are used to analyze the benchmark indices and extended indices. The results of the AUC and Precision evaluation metrics show that the path extension similarity proposed in this paper has higher accuracy and stronger robustness than the benchmark indices.
引用
收藏
页码:83 / 92
页数:10
相关论文
共 46 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]   DEEPEYE: Link Prediction in Dynamic Networks Based on Non-negative Matrix Factorization [J].
Ahmed, Nahla Mohamed ;
Chen, Ling ;
Wang, Yulong ;
Li, Bin ;
Li, Yun ;
Liu, Wei .
BIG DATA MINING AND ANALYTICS, 2018, 1 (01) :19-33
[3]   Link communities reveal multiscale complexity in networks [J].
Ahn, Yong-Yeol ;
Bagrow, James P. ;
Lehmann, Sune .
NATURE, 2010, 466 (7307) :761-U11
[4]  
Anupriya A. Singhrova, 2021, ICT EXPRESS, V7, P143, DOI DOI 10.1016/j.icte.2021.05.005
[5]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[6]   Predicting Citation Count of Scientists as a Link Prediction Problem [J].
Butun, Ertan ;
Kaya, Mehmet .
IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (10) :4518-4529
[7]   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
[8]   Advanced manufacturing systems: supply-demand matching of manufacturing resource based on complex networks and Internet of Things [J].
Cheng, Ying ;
Tao, Fei ;
Xu, Lida ;
Zhao, Dongming .
ENTERPRISE INFORMATION SYSTEMS, 2018, 12 (07) :780-797
[9]   A hybrid network-based method for the detection of disease-related genes [J].
Cui, Ying ;
Cai, Meng ;
Dai, Yang ;
Stanley, H. Eugene .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 492 :389-394
[10]   Computationally Efficient Link Prediction in a Variety of Social Networks [J].
Fire, Michael ;
Tenenboim-Chekina, Lena ;
Puzis, Rami ;
Lesser, Ofrit ;
Rokach, Lior ;
Elovici, Yuval .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2013, 5 (01)