SimGRL: a simple self-supervised graph representation learning framework via triplets

被引:0
作者
Da Huang
Fangyuan Lei
Xi Zeng
机构
[1] Guangdong Polytechnic Normal University,School of Electronic and Information
[2] Guang-dong Polytechnic Normal University,Guangdong Provincial Key Laboratory of Intellectual Property and Big Data
来源
Complex & Intelligent Systems | 2023年 / 9卷
关键词
Graph representation learning; Graph neural networks; Self-supervised learning; Triplet loss; Node classification; Graph classification;
D O I
暂无
中图分类号
学科分类号
摘要
Recently, graph contrastive learning (GCL) has achieved remarkable performance in graph representation learning. However, existing GCL methods usually follow a dual-channel encoder network (i.e., Siamese networks), which adds to the complexity of the network architecture. Additionally, these methods overly depend on varied data augmentation techniques, corrupting graph information. Furthermore, they are heavily reliant on large quantities of negative nodes for each object node, which requires tremendous memory costs. To address these issues, we propose a novel and simple graph representation learning framework, named SimGRL. Firstly, our proposed network architecture only contains one encoder based on a graph neural network instead of a dual-channel encoder, which simplifies the network architecture. Then we introduce a distributor to generate triplets to obtain the contrastive views between nodes and their neighbors, avoiding the need for data augmentations. Finally, we design a triplet loss based on adjacency information in graphs that utilizes only one negative node for each object node, reducing memory overhead significantly. Extensive experiments demonstrate that SimGRL achieves competitive performance on node classification and graph classification tasks, especially in terms of running time and memory overhead.
引用
收藏
页码:5049 / 5062
页数:13
相关论文
共 59 条
[1]  
Hu W(2020)Open graph benchmark: datasets for machine learning on graphs Adv Neural Inf Process Syst 33 22118-22133
[2]  
Fey M(2022)Graphlime: Local interpretable model explanations for graph neural networks IEEE Trans Knowl Data Eng 2 1-6
[3]  
Zitnik M(2021)A survey of community detection approaches: From statistical modeling to deep learning IEEE Trans Knowl Data Eng 2 1-1027
[4]  
Dong Y(2021)Graph kernels: a survey J Artif Intell Res 72 943-93
[5]  
Ren H(2008)Collective classification in network data AI Mag 29 93-2561
[6]  
Liu B(2011)Weisfeiler–lehman graph kernels J Mach Learn Res 12 2539-24
[7]  
Catasta M(2020)A comprehensive survey on graph neural networks IEEE Trans Neural Netw Learn Syst 32 4-7377
[8]  
Leskovec J(2019)Graph convolutional networks for text classification Proc AAAI Conf Artif Intell 33 7370-5823
[9]  
Huang Q(2020)Graph contrastive learning with augmentations Adv Neural Inf Process Syst 33 5812-13
[10]  
Yamada M(2021)Multi-stage attention and center triplet loss for person re-identication Appl Intell 2 1-2080