Generative image inpainting for link prediction

被引:4
作者
Qian, Fulan [1 ,2 ]
Li, Jianhong [1 ,2 ]
Du, Xiuquan [1 ,2 ]
Chen, Xi [1 ,2 ]
Zhao, Shu [1 ,2 ]
Zhang, Yanping [1 ,2 ]
机构
[1] Minist Educ, Key Lab Intelligent Comp & Signal Proc, Hefei, Peoples R China
[2] Anhui Univ, Sch Comp Sci & Technol, Hefei, Peoples R China
关键词
Link prediction; Image inpainting; Generative adversarial networks; ALGORITHM;
D O I
10.1007/s10489-020-01648-w
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Link prediction is a fundamental task that predicts whether a link exists between two nodes based on the currently observed network. Existing approaches such as heuristic-based algorithms assume that two nodes are likely to have a link in a network. In fact, they limit algorithm effectiveness when the assumptions are not correct. Moreover, these link prediction algorithms lack generalization ability, which indicates that they have different effects on different types of networks. For example, the common neighbours algorithm works well on social networks, but it shows poor performance on electric power networks. Inspired by the image inpainting technology of generative adversarial networks and the adjacency matrix representation of networks, we propose a new framework for link prediction based on the image inpainting method, named the Generative Image Inpainting for Link Prediction algorithm (GIILP), to address these problems. The key idea of the GIILP is that the network can be converted into an image (the image is a form of the adjacency matrix (two dimensions)). Pixel values represent the likelihood of two nodes. Thus, the problem of predicting a possible link between nodes is converted into filling missing pixels in an image. The link information of the network can be expressed by the image information, which means that our algorithm does not need assumptions such as heuristics, and works regardless of the dataset type. The experimental results on multiple link prediction public datasets demonstrate that our algorithm has an advantage over other algorithms, including heuristic-based and deep learning methods.
引用
收藏
页码:4482 / 4494
页数:13
相关论文
共 42 条
[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]  
Al-Rfou Rami, 2014, P 20 ACM SIGKDD INT, DOI DOI 10.1145/2623330.2623732
[4]  
Arjovsky M., 2017, P 34 INT C MACH LEAR, DOI DOI 10.48550/ARXIV.1701.07875
[5]   Filling-in by joint interpolation of vector fields and gray levels [J].
Ballester, C ;
Bertalmio, M ;
Caselles, V ;
Sapiro, G ;
Verdera, J .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2001, 10 (08) :1200-1211
[6]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[7]  
Bo K, 2019, P INT C LEARN REPR
[8]  
CHENG XS, 2009, EUROP PHYS J B, P623
[9]   An Ensemble Approach to Link Prediction [J].
Duan, Liang ;
Ma, Shuai ;
Aggarwal, Charu ;
Ma, Tiejun ;
Huai, Jinpeng .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2017, 29 (11) :2402-2416
[10]   A link prediction algorithm based on low-rank matrix completion [J].
Gao, Man ;
Chen, Ling ;
Li, Bin ;
Liu, Wei .
APPLIED INTELLIGENCE, 2018, 48 (12) :4531-4550