RoSANE: Robust and scalable attributed network embedding for sparse networks

被引:18
作者
Hou, Chengbin [1 ,2 ]
He, Shan [2 ]
Tang, Ke [1 ]
机构
[1] Southern Univ Sci & Technol, Dept Comp Sci & Engn, Guangdong Prov Key Lab Brain Inspired Intelligent, Shenzhen 518055, Peoples R China
[2] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England
关键词
Attributed Network Embedding; Sparse networks; Ball-tree K-nearest neighbors; Random walks; Skip-gram model;
D O I
10.1016/j.neucom.2020.05.080
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Attributed networks can better describe the real-world complex systems where the interaction or relationship between entities can be represented as networks and the auxiliary information can be represented as node attributes. Attributed Network Embedding (ANE) is attracting much attention. It utilizes network topology and node attributes to jointly learn enhanced low-dimensional node embeddings so as to facilitate various downstream inference tasks. However, the existing ANE methods cannot effectively embed attributed sparse networks which are important real-world scenarios, and/or are not scalable to large-scale networks. To tackle these challenges, we first integrate network topology and node attributes to reconstruct an enriched denser network, and then learn node embeddings upon the denser network. In above two steps, the techniques such as Ball-tree K-Nearest Neighbors and random walks based Skip-Gram model are adopted to guarantee the scalability, which is demonstrated via theoretical complexity analysis. The extensive empirical studies show the effectiveness and efficiency of the proposed method, as well as its robustness to different networks or the same network with different sparsities. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码:231 / 243
页数:13
相关论文
共 53 条
[1]  
[Anonymous], 2013, NIPS
[2]  
[Anonymous], 2000, WORKSH ART INT WEB S
[3]   Outlier Resistant Unsupervised Deep Architectures for Attributed Network Embedding [J].
Bandyopadhyay, Sambaran ;
Lokesh, N. ;
Vivek, Saley Vishal ;
Murty, M. N. .
PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, :25-33
[4]   Efficient generation of large random networks [J].
Batagelj, V ;
Brandes, U .
PHYSICAL REVIEW E, 2005, 71 (03)
[5]   On the Network Embedding in Sparse Signed Networks [J].
Bhowmick, Ayan Kumar ;
Meneni, Koushik ;
Mitra, Bivas .
ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2019, PT III, 2019, 11441 :94-106
[6]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[7]   A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications [J].
Cai, HongYun ;
Zheng, Vincent W. ;
Chang, Kevin Chen-Chuan .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (09) :1616-1637
[8]  
Cao S.S., 2015, P 24 ACM INT C INF K, P891
[9]   A Survey on Network Embedding [J].
Cui, Peng ;
Wang, Xiao ;
Pei, Jian ;
Zhu, Wenwu .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (05) :833-852
[10]  
Gao HC, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P3364