A Simple Yet Effective Layered Loss for Pre-Training of Network Embedding

被引:6
作者
Chen, Junyang [1 ]
Li, Xueliang [1 ]
Li, Yuanman [2 ]
Li, Paul [3 ]
Wang, Mengzhu [4 ]
Zhang, Xiang [4 ]
Gong, Zhiguo [5 ]
Wu, Kaishun [1 ]
Leung, Victor C. M. [1 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[2] Shenzhen Univ, Coll Elect & Informat Engn, Guangdong Key Lab Intelligent Informat Proc, Shenzhen 518060, Peoples R China
[3] Baidu Res, Sunnyvale, CA 94089 USA
[4] Natl Univ Def Technol, Coll Comp, Changsha 564211, Peoples R China
[5] Univ Macau, Dept Comp Informat Sci, State Key Lab Internet Things Smart City, Macau 999078, Peoples R China
来源
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING | 2022年 / 9卷 / 03期
基金
中国国家自然科学基金;
关键词
Task analysis; Graph neural networks; Training; Propagation losses; Message passing; Aggregates; Web and internet services; layered loss; network embedding; pre-training of unlabeled nodes;
D O I
10.1109/TNSE.2022.3153643
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Pre-training of network embedding aims to encode unlabeled node proximity into a low-dimensional space, where nodes are close to their neighbors while being far from negative samples. In recent years, Graph Neural Networks have shown groundbreaking performance in semi-supervised learning on the node classification and link prediction tasks. However, because of their inherent information aggregation pattern, almost all these methods can only obtain inferior embedding results in the pre-training of the unlabeled nodes. The margins between a target node and its multi-hop neighbors become hard distinguishable during node message aggregation. To address this problem, we propose a simple yet effective layered loss to combine with a graph attention network, dubbed as LlossNet, for pre-training. We regard the proximity of a target node and its two-hop neighbors as a unit (called a unit graph), where a target node is needed to be more closer to its direct neighbor than its two-hop neighbors. As such, LlossNet would be able to preserve the margins of nodes in the learned embedding space. Experimental results of various downstream tasks including classification and clustering demonstrate the effectiveness of our method on learning discriminative node representations.
引用
收藏
页码:1827 / 1837
页数:11
相关论文
共 35 条
[1]  
Abadi M, 2016, ACM SIGPLAN NOTICES, V51, P1, DOI [10.1145/2951913.2976746, 10.1145/3022670.2976746]
[2]   Adversarial Caching Training: Unsupervised Inductive Network Representation Learning on Large-Scale Graphs [J].
Chen, Junyang ;
Gong, Zhiguo ;
Wang, Wei ;
Wang, Cong ;
Xu, Zhenghua ;
Lv, Jianming ;
Li, Xueliang ;
Wu, Kaishun ;
Liu, Weiwen .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2022, 33 (12) :7079-7090
[3]   Self-Training Enhanced: Network Embedding and Overlapping Community Detection With Adversarial Learning [J].
Chen, Junyang ;
Gong, Zhiguo ;
Mo, Jiqian ;
Wang, Wei ;
Wang, Cong ;
Dong, Xiao ;
Li, Weiwen ;
Wu, Kaishun .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2022, 33 (11) :6737-6748
[4]   HNS: Hierarchical negative sampling for network representation learning [J].
Chen, Junyang ;
Gong, Zhiguo ;
Wang, Wei ;
Liu, Weiwen .
INFORMATION SCIENCES, 2021, 542 :343-356
[5]   How Do the Open Source Communities Address Usability and UX Issues? An Exploratory Study [J].
Cheng, Jinghui ;
Guo, Jin L. C. .
CHI 2018: EXTENDED ABSTRACTS OF THE 2018 CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, 2018,
[6]   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
[7]  
Fan RE, 2008, J MACH LEARN RES, V9, P1871
[8]   Metapath-guided Heterogeneous Graph Neural Network for Intent Recommendation [J].
Fan, Shaohua ;
Zhu, Junxiong ;
Han, Xiaotian ;
Shi, Chuan ;
Hu, Linmei ;
Ma, Biyu ;
Li, Yongliang .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :2478-2486
[9]  
Gao HC, 2019, KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P1308, DOI 10.1145/3292500.3330866
[10]  
Glorot X., 2011, P 14 INT C ART INT S, P315, DOI DOI 10.1002/ECS2.1832