Effective Link Prediction Based on Community Relationship Strength

被引:25
作者
Li, Longjie [1 ]
Fang, Shiyu [1 ]
Bai, Shenshen [1 ,2 ]
Xu, Shijin [1 ]
Cheng, Jianjun [1 ]
Chen, Xiaoyun [1 ]
机构
[1] Lanzhou Univ, Sch Informat Sci & Engn, Lanzhou 730000, Gansu, Peoples R China
[2] Lanzhou Vocat Tech Coll, Dept Elect & Informat Engn, Lanzhou 730070, Gansu, Peoples R China
基金
中国国家自然科学基金;
关键词
Link prediction; community structure; similarity index; complex networks; COMPLEX NETWORKS; ALLOCATION; ALGORITHM; MODEL;
D O I
10.1109/ACCESS.2019.2908208
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Link prediction is one of the research hotspots in complex network analysis and has a wide range of applications in both theory and reality. To improve the prediction accuracy, this paper proposes a new link prediction framework by considering both node similarity and community information, which overcomes the weaknesses of existing community-based prediction methods. In the proposed framework, a reasonable measure, called community relationship strength (CRS), is defined to estimate the closeness between communities. In this paper, we hold the view that the connection likelihood between two target nodes rests upon not only their similarity but also the closeness of communities that they belong to. Therefore, to measure the connection likelihood, the proposed framework combines CRS with traditional similarity indexes. Three CRS-based methods are derived from the framework. The performance of the CRS-based methods is comprehensively studied on 12 real-world networks compared with several groups of baselines. The experimental results indicate that the CRS-based methods are more effective and robust than others.
引用
收藏
页码:43233 / 43248
页数:16
相关论文
共 74 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]  
Adamic LA., 2005, P 3 INT WORKSH LINK, P36, DOI DOI 10.1145/1134271.1134277
[3]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[4]  
[Anonymous], 2017, ENERGIES, DOI DOI 10.1063/1.4998611
[5]  
[Anonymous], COMPLEXITY
[6]  
[Anonymous], INT J MODERN PHYS B
[7]  
[Anonymous], 2017, ACM COMPUT SURV, DOI DOI 10.1145/3012704
[8]  
[Anonymous], ADV NEURAL INF PROCE
[9]  
[Anonymous], NETWORK BOOKS US POL
[10]  
[Anonymous], 2006, J. Mach. Learn. Res.