A New Link Prediction Method for Complex Networks Based on Topological Effectiveness of Resource Transmission Paths

被引：3

作者：

Wang Kai ^{[1
]}

Li Xing ^{[1
]}

Lan Julong ^{[1
]}

Wei Hongquan ^{[1
]}

Liu Shuxin ^{[1
]}

机构：

[1] Natl Digital Switching Syst Engn & Technol R&D Ct, Zhengzhou 450002, Peoples R China

来源：

JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY | 2020年 / 42卷 / 03期

基金：

中国国家自然科学基金;

关键词：

Complex network; Link prediction; Resource transmission path; Effectiveness; SCIENCE;

D O I：

10.11999/JEIT190333

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Link prediction considers to discover the unknown or missing links of complex networks by using the existing topology or other information. Resource Allocation index can achieve a good performance with low complexity. However, it ignores the path effectiveness of resource transmission process. The resource transmission process is an important internal driving force for the evolution of the network. By analyzing the effectiveness of the topology around the resource transmission path between nodes, a link prediction method based on topological effectiveness of resource transmission paths is proposed. Firstly, the influence of potential resource transmission paths between nodes on resource transmission is analyzed, and a quantitative method for resource transmission path effectiveness is proposed. Then, based on the effectiveness of the resource transmission path, after studying the two-way resource transmission amount between two nodes, the transmission path effectiveness index is proposed. The experimental results of 12 real networks show that compared with other link prediction methods, the proposed method can achieve higher prediction accuracy under the AUC and Precision metrics.

引用

页码：653 / 660

页数：8

共 26 条

[1] Friends and neighbors on the Web [J].

Adamic, LA ;

Adar, E .

SOCIAL NETWORKS, 2003, 25 (03) :211-230

[2]

[Anonymous], PSYCHOMETRIKA

[3] Simplicial closure and higher-order link prediction [J].

Benson, Austin R. ;

Abebe, Rediet ;

Schaub, Michael T. ;

Jadbabaie, Ali ;

Kleinberg, Jon .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2018, 115 (48) :E11221-E11230

[4] 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

[5] 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

[6] Robustness of Interdependent Power Grids and Communication Networks: A Complex Network Perspective [J].

Chen, Zhenhao ;

Wu, Jiajing ;

Xia, Yongxiang ;

Zhang, Xi .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2018, 65 (01) :115-119

[7] The networked evolutionary algorithm: A network science perspective [J].

Du, Wenbo ;

Zhang, Mingyuan ;

Ying, Wen ;

Perc, Matjaz ;

Tang, Ke ;

Cao, Xianbin ;

Wu, Dapeng .

APPLIED MATHEMATICS AND COMPUTATION, 2018, 338 :33-43

[8] 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

[9] Network science of biological systems at different scales: A review [J].

Gosak, Marko ;

Markovic, Rene ;

Dolensek, Jurij ;

Rupnik, Marjan Slak ;

Marhl, Marko ;

Stozer, Andra ;

Perc, Matjaz .

PHYSICS OF LIFE REVIEWS, 2018, 24 :118-135

[10] RESISTANCE DISTANCE [J].

KLEIN, DJ ;

RANDIC, M .

JOURNAL OF MATHEMATICAL CHEMISTRY, 1993, 12 (1-4) :81-95

← 1 2 3 →