Unsupervised social network embedding via adaptive specific mappings

被引:4
作者
Ge, Youming [1 ]
Huang, Cong [1 ]
Liu, Yubao [1 ,2 ]
Zhang, Sen [1 ]
Kong, Weiyang [1 ]
机构
[1] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510275, Peoples R China
[2] Guangdong Key Lab Big Data Anal & Proc, Guangzhou 510006, Peoples R China
基金
中国国家自然科学基金;
关键词
network embedding; specific kernel mapping; attention mechanism;
D O I
10.1007/s11704-023-2180-3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we address the problem of unsuperised social network embedding, which aims to embed network nodes, including node attributes, into a latent low dimensional space. In recent methods, the fusion mechanism of node attributes and network structure has been proposed for the problem and achieved impressive prediction performance. However, the non-linear property of node attributes and network structure is not efficiently fused in existing methods, which is potentially helpful in learning a better network embedding. To this end, in this paper, we propose a novel model called ASM (Adaptive Specific Mapping) based on encoder-decoder framework. In encoder, we use the kernel mapping to capture the non-linear property of both node attributes and network structure. In particular, we adopt two feature mapping functions, namely an untrainable function for node attributes and a trainable function for network structure. By the mapping functions, we obtain the low dimensional feature vectors for node attributes and network structure, respectively. Then, we design an attention layer to combine the learning of both feature vectors and adaptively learn the node embedding. In encoder, we adopt the component of reconstruction for the training process of learning node attributes and network structure. We conducted a set of experiments on seven real-world social network datasets. The experimental results verify the effectiveness and efficiency of our method in comparison with state-of-the-art baselines.
引用
收藏
页数:11
相关论文
共 42 条
[1]  
Bandyopadhyay S, 2019, AAAI CONF ARTIF INTE, P12
[2]   Representation Learning: A Review and New Perspectives [J].
Bengio, Yoshua ;
Courville, Aaron ;
Vincent, Pascal .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (08) :1798-1828
[3]  
Cao S., 2015, P 24 ACM INT C INF K, P891
[4]  
Cao SS, 2016, AAAI CONF ARTIF INTE, P1145
[5]   Representation Learning for Attributed Multiplex Heterogeneous Network [J].
Cen, Yukuo ;
Zou, Xu ;
Zhang, Jianwei ;
Yang, Hongxia ;
Zhou, Jingren ;
Tang, Jie .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :1358-1368
[6]  
Chen HC, 2018, AAAI CONF ARTIF INTE, P2127
[7]   Incorporate Group Information to Enhance Network Embedding [J].
Chen, Jifan ;
Zhang, Qi ;
Huang, Xuanjing .
CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2016, :1901-1904
[8]   Adaptive Graph Encoder for Attributed Graph Embedding [J].
Cui, Ganqu ;
Zhou, Jie ;
Yang, Cheng ;
Liu, Zhiyuan .
KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, :976-985
[9]  
Gao HC, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P3364
[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