Link prediction based on local weighted paths for complex networks

被引:8
作者
Yao, Yabing [1 ]
Zhang, Ruisheng [1 ]
Yang, Fan [1 ]
Yuan, Yongna [1 ]
Hu, Rongjing [1 ]
Zhao, Zhili [1 ]
机构
[1] Lanzhou Univ, Sch Informat Sci & Engn, Lanzhou 730000, Gansu, Peoples R China
来源
INTERNATIONAL JOURNAL OF MODERN PHYSICS C | 2017年 / 28卷 / 04期
基金
中国国家自然科学基金;
关键词
Complex networks; link degree; link prediction; node similarity; path weight; MISSING LINKS;
D O I
10.1142/S012918311750053X
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
As a signicant problem in complex networks, link prediction aims find the missing and future links between two unconnected nodes by estimating the existence likelihood of potential links. It plays an important role in understanding the evolution mechanism of networks and has broad applications in practice. In order to improve prediction performance, a variety of structural similarity-based methods that rely on different topological features have been put forward. As one topological feature, the path information between node pairs is utilized to calculate the node similarity. However, many path-dependent methods neglect the different contributions of paths for a pair of nodes. In this paper, a local weighted path (LWP) index is proposed to differentiate the contributions between paths. The LWP index considers the effect of the link degrees of intermediate links and the connectivity influence of intermediate nodes on paths to quantify the path weight in the prediction procedure. The experimental results on 12 real-world networks show that the LWP index outperforms other seven prediction baselines.
引用
收藏
页数:23
相关论文
共 53 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]  
[Anonymous], ARXIV150401018
[3]  
[Anonymous], 1983, Introduction to Modern Information Retrieval
[4]  
[Anonymous], 1993, The Stanford graph base: A platform for combinatorial computing
[5]  
[Anonymous], 1998, An information-theoretic definition of similarity
[6]  
[Anonymous], 2016, SIGKDD Explor., DOI DOI 10.1145/2897350.2897355
[7]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[8]   The network takeover [J].
Barabasi, Albert-Laszlo .
NATURE PHYSICS, 2012, 8 (01) :14-16
[9]   Network link prediction by global silencing of indirect correlations [J].
Barzel, Baruch ;
Barabasi, Albert-Laszlo .
NATURE BIOTECHNOLOGY, 2013, 31 (08) :720-725
[10]   Complex networks: Structure and dynamics [J].
Boccaletti, S. ;
Latora, V. ;
Moreno, Y. ;
Chavez, M. ;
Hwang, D. -U. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5) :175-308