Link Prediction with Contextualized Self-Supervision

被引:6
作者
Zhang, Daokun [1 ]
Yin, Jie [2 ]
Yu, Philip S. S. [3 ]
机构
[1] Monash Univ, Fac Informat Technol, Dept Data Sci & AI, Clayton, Vic 3800, Australia
[2] Univ Sydney, Discipline Business Analyt, Camperdown, NSW 2006, Australia
[3] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
关键词
Link prediction; self-supervised learning; attributed networks; GRAPH; NETWORKS;
D O I
10.1109/TKDE.2022.3200390
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Link prediction aims to infer the link existence between pairs of nodes in networks/graphs. Despite their wide application, the success of traditional link prediction algorithms is hindered by three major challenges-link sparsity, node attribute noise and dynamic changes-that are faced by many real-world networks. To address these challenges, we propose a Contextualized Self-Supervised Learning (CSSL) framework that fully exploits structural context prediction for link prediction. The proposed CSSL framework learns a link encoder to infer the link existence probability from paired node embeddings, which are constructed via a transformation on node attributes. To generate informative node embeddings for link prediction, structural context prediction is leveraged as a self-supervised learning task to boost the link prediction performance. Two types of structural context are investigated, i.e., context nodes collected from random walks versus context subgraphs. The CSSL framework can be trained in an end-to-end manner, with the learning of model parameters supervised by both the link prediction and self-supervised learning tasks. The proposed CSSL is a generic and flexible framework in the sense that it can handle both attributed and non-attributed networks, and operate under both transductive and inductive link prediction settings. Extensive experiments and ablation studies on seven real-world benchmark networks demonstrate the superior performance of the proposed self-supervision based link prediction algorithm over state-of-the-art baselines, on different types of networks under both transductive and inductive settings. The proposed CSSL also yields competitive performance in terms of its robustness to node attribute noise and scalability over large-scale networks.
引用
收藏
页码:7138 / 7151
页数:14
相关论文
共 57 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[3]  
Cao SS, 2016, AAAI CONF ARTIF INTE, P1145
[4]  
Devlin J, 2019, 2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, P4171
[5]   Link Prediction and Recommendation across Heterogeneous Social Networks [J].
Dong, Yuxiao ;
Tang, Jie ;
Wu, Sen ;
Tian, Jilei ;
Chawla, Nitesh V. ;
Rao, Jinghai ;
Cao, Huanhuan .
12TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2012), 2012, :181-190
[6]   Graph Neural Networks for Social Recommendation [J].
Fan, Wenqi ;
Ma, Yao ;
Li, Qing ;
He, Yuan ;
Zhao, Eric ;
Tang, Jiliang ;
Yin, Dawei .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :417-426
[7]  
Fu C, 2019, PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P4961
[8]   Generalised bilinear regression [J].
Gabriel, KR .
BIOMETRIKA, 1998, 85 (03) :689-700
[9]   Stacking models for nearly optimal link prediction in complex networks [J].
Ghasemian, Amir ;
Hosseinmardi, Homa ;
Galstyan, Aram ;
Airoldi, Edoardo M. ;
Clauset, Aaron .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2020, 117 (38) :23393-23400
[10]   Scaling and Benchmarking Self-Supervised Visual Representation Learning [J].
Goyal, Priya ;
Mahajan, Dhruv ;
Gupta, Abhinav ;
Misra, Ishan .
2019 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2019), 2019, :6400-6409