Position-Aware and Subgraph Enhanced Dynamic Graph Contrastive Learning on Discrete-Time Dynamic Graph

被引:0
作者
Feng, Jian [1 ]
Liu, Tian [1 ]
Du, Cailing [1 ]
机构
[1] Xian Univ Sci & Technol, Coll Comp Sci & Technol, Xian 710054, Peoples R China
来源
CMC-COMPUTERS MATERIALS & CONTINUA | 2024年 / 81卷 / 02期
关键词
Dynamic graph representation learning; graph contrastive learning; structure representation; position; representation; evolving pattern;
D O I
10.32604/cmc.2024.056434
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Unsupervised learning methods such as graph contrastive learning have been used for dynamic graph representation learning to eliminate the dependence of labels. However, existing studies neglect positional information when learning discrete snapshots, resulting in insufficient network topology learning. At the same time, due to the lack of appropriate data augmentation methods, it is difficult to capture the evolving patterns of the network effectively. To address the above problems, a position-aware and subgraph enhanced dynamic graph contrastive learning method is proposed for discrete-time dynamic graphs. Firstly, the global snapshot is built based on the historical snapshots to express the stable pattern of the dynamic graph, and the random walk is used to obtain the position representation by learning the positional information of the nodes. Secondly, a new data augmentation method is carried out from the perspectives of short-term changes and long-term stable structures of dynamic graphs. Specifically, subgraph sampling based on snapshots and global snapshots is used to obtain two structural augmentation views, and node structures and evolving patterns are learned by combining graph neural network, gated recurrent unit, and attention mechanism. Finally, the quality of node representation is improved by combining the contrastive learning between different structural augmentation views and between the two representations of structure and position. Experimental results on four real datasets show that the performance of the proposed method is better than the existing unsupervised methods, and it is more competitive than the supervised learning method under a semi-supervised setting.
引用
收藏
页码:2895 / 2909
页数:15
相关论文
共 21 条
[1]  
Bai Q., 2023, ACM WEB C, P523
[2]   Dynamic Graph Contrastive Learning via Maximize Temporal Consistency [J].
Bao, Peng ;
Li, Jianian ;
Yan, Rong ;
Liu, Zhongyi .
PATTERN RECOGNITION, 2024, 148
[3]   Temporal Graph Representation Learning with Adaptive Augmentation Contrastive [J].
Chen, Hongjiang ;
Jiao, Pengfei ;
Tang, Huijun ;
Wu, Huaming .
MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES: RESEARCH TRACK, ECML PKDD 2023, PT II, 2023, 14170 :683-699
[4]  
Chen JL, 2023, AAAI CONF ARTIF INTE, P7024
[5]   Combine temporal information in session-based recommendation with graph neural networks [J].
Chen, Quanzhen ;
Jiang, Feng ;
Guo, Xuyao ;
Chen, Jin ;
Sha, Kaiyue ;
Wang, Yuxuan .
EXPERT SYSTEMS WITH APPLICATIONS, 2024, 238
[6]  
Chen T, 2020, PR MACH LEARN RES, V119
[7]  
De Winter S, 2018, 2018 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), P1234, DOI 10.1109/ASONAM.2018.8508272
[8]  
Kong WY, 2024, AAAI CONF ARTIF INTE, P8627
[9]  
Li Hongxi, 2024, PMLR, P739
[10]   DyTSCL: Dynamic graph representation via tempo-structural contrastive learning [J].
Li, Jianian ;
Bao, Peng ;
Yan, Rong ;
Shen, Huawei .
NEUROCOMPUTING, 2023, 556