A fusion probability matrix factorization framework for link prediction

被引:32
作者
Wang, Zhiqiang [1 ]
Liang, Jiye [1 ]
Li, Ru [1 ]
机构
[1] Shanxi Univ, Sch Comp & Informat Technol, Minist Educ, Key Lab Computat Intelligence & Chinese Informat, Taiyuan 030006, Shanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Network data analysis; Probability matrix factorization; Link prediction; Fusion model; MISSING LINKS; GRAPH;
D O I
10.1016/j.knosys.2018.06.005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Link prediction is a fundamental research problem in network data analysis. Networks usually contain rich node to-node topological metrics and their effective use is crucial to solve the link prediction problem. Despite significant advances, the existing metric-based link prediction methods usually only consider one single topological metric and thus show some limitations in different types of networks; the existing matrix factorization-based models mainly focus on modeling the adjacent matrix of a network, and this is hard to ensure the modeling of those topological metrics that can play an important role in link prediction. This study develops effective approaches by fusing the adjacent matrix and some key topological metrics in a unified probability matrix factorization framework. In these approaches, we consider not only the symmetric metrics but also the asymmetric metrics which are usually not taken into consideration in the related work. In our probability matrix factorization framework, we first present two fusion models by fusing two kinds of metrics respectively, and based on the fusion models, we put forward the final fusion models which fuse the two kinds of metrics simultaneously. To verify the performance of all the fusion models, we conduct the experiments with six directed networks and six undirected ones, and the extensive experiments show that the proposed models provide impressive predicting performance for link prediction.
引用
收藏
页码:72 / 85
页数:14
相关论文
共 69 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]  
Airoldi EM, 2008, J MACH LEARN RES, V9, P1981
[3]  
[Anonymous], DATA MIN KNOWL DISCO
[4]  
[Anonymous], 2013, 23 INT JOINT C ART I
[5]  
[Anonymous], STOCH PROCESS APPL
[6]  
[Anonymous], 2010, P INT C WORLD WID WE
[7]  
[Anonymous], 2009, Advances in neural information processing systems
[8]  
[Anonymous], P 27 C UNC ART INT B
[9]  
[Anonymous], 1971, Journal of Mathematical Sociology, DOI 10.1080/0022250X.1971.9989788
[10]  
[Anonymous], ACM COMPUT SURV CSUR