DINE: A Framework for Deep Incomplete Network Embedding

被引:2
作者
Hou, Ke [1 ]
Liu, Jiaying [1 ]
Peng, Yin [1 ]
Xu, Bo [1 ]
Lee, Ivan [2 ]
Xia, Feng [3 ]
机构
[1] Dalian Univ Technol, Sch Software, Key Lab Ubiquitous Network & Serv Software Liaoni, Dalian 116620, Peoples R China
[2] Univ South Australia, Sch Informat Technol & Math Sci, Adelaide, SA 5095, Australia
[3] Federation Univ, Sch Sci Engn & Informat Technol, Ballarat, Vic, Australia
来源
AI 2019: ADVANCES IN ARTIFICIAL INTELLIGENCE | 2019年 / 11919卷
关键词
Incomplete network embedding; Network completion; Network representation learning; Deep learning; PREDICTION;
D O I
10.1007/978-3-030-35288-2_14
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Network representation learning (NRL) plays a vital role in a variety of tasks such as node classification and link prediction. It aims to learn low-dimensional vector representations for nodes based on network structures or node attributes. While embedding techniques on complete networks have been intensively studied, in real-world applications, it is still a challenging task to collect complete networks. To bridge the gap, in this paper, we propose a Deep Incomplete Network Embedding method, namely DINE. Specifically, we first complete the missing part including both nodes and edges in a partially observable network by using the expectation-maximization framework. To improve the embedding performance, we consider both network structures and node attributes to learn node representations. Empirically, we evaluate DINE over three networks on multi-label classification and link prediction tasks. The results demonstrate the superiority of our proposed approach compared against stateof-the-art baselines.
引用
收藏
页码:165 / 176
页数:12
相关论文
共 30 条
[1]  
Ahmed A., 2013, P 22 INT C WORLD WID, P37, DOI DOI 10.1145/2488388.2488393
[2]   The Role of Positive and Negative Citationsin Scientific Evaluation [J].
Bai, Xiaomei ;
Lee, Ivan ;
Ning, Zhaolong ;
Tolba, Amr ;
Xia, Feng .
IEEE ACCESS, 2017, 5 :17607-17617
[3]  
Bhagat S, 2011, SOCIAL NETWORK DATA ANALYTICS, P115
[4]   Discovering missing me edges across social networks [J].
Buccafurri, Francesco ;
Lax, Gianluca ;
Nocera, Antonin ;
Ursino, Domenico .
INFORMATION SCIENCES, 2015, 319 :18-37
[5]   Scholarly impact assessment: a survey of citation weighting solutions [J].
Cai, Liwei ;
Tian, Jiahao ;
Liu, Jiaying ;
Bai, Xiaomei ;
Lee, Ivan ;
Kong, Xiangjie ;
Xia, Feng .
SCIENTOMETRICS, 2019, 118 (02) :453-478
[6]   Hierarchical structure and the prediction of missing links in networks [J].
Clauset, Aaron ;
Moore, Cristopher ;
Newman, M. E. J. .
NATURE, 2008, 453 (7191) :98-101
[7]  
Gallinari P., 2011, P 20 ACM INT C INF K, P1169
[8]  
Gao HC, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P3364
[9]   Graph embedding techniques, applications, and performance: A survey [J].
Goyal, Palash ;
Ferrara, Emilio .
KNOWLEDGE-BASED SYSTEMS, 2018, 151 :78-94
[10]   node2vec: Scalable Feature Learning for Networks [J].
Grover, Aditya ;
Leskovec, Jure .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :855-864