MDGCL: Graph Contrastive Learning Framework with Multiple Graph Diffusion Methods

被引:0
|
作者
Li, Yuqiang [1 ]
Zhang, Yi [1 ]
Liu, Chun [1 ]
机构
[1] Wuhan Univ Technol, Sch Comp Sci & Technol, Wuhan, Peoples R China
关键词
Graph neural networks; Graph contrastive learning; Graph diffusion; Node classification; CONVOLUTIONAL NETWORKS;
D O I
10.1007/s11063-024-11672-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, some classical graph contrastive learning(GCL) frameworks have been proposed to address the problem of sparse labeling of graph data in the real world. However, in node classification tasks, there are two obvious problems with existing GCL frameworks: first, the stochastic augmentation methods they adopt lose a lot of semantic information; second, the local-local contrasting mode selected by most frameworks ignores the global semantic information of the original graph, which limits the node classification performance of these frameworks. To address the above problems, this paper proposes a novel graph contrastive learning framework, MDGCL, which introduces two graph diffusion methods, Markov and PPR, and a deterministic-stochastic data augmentation strategy while retaining the local-local contrasting mode. Specifically, before using the two stochastic augmentation methods (FeatureDrop and EdgeDrop), MDGCL first uses two deterministic augmentation methods (Markov diffusion and PPR diffusion) to perform data augmentation on the original graph to increase the semantic information, this step ensures subsequent stochastic augmentation methods do not lose too much semantic information. Meanwhile, the diffusion matrices carried by the augmented views contain global semantic information of the original graph, allowing the framework to utilize the global semantic information while retaining the local-local contrasting mode, which further enhances the node classification performance of the framework. We conduct extensive comparative experiments on multiple benchmark datasets, and the results show that MDGCL outperforms the representative baseline frameworks on node classification tasks. Among them, compared with COSTA, MDGCL's node classification accuracy has been improved by 1.07% and 0.41% respectively on two representative datasets, Amazon-Photo and Coauthor-CS. In addition, we also conduct ablation experiments on two datasets, Cora and CiteSeer, to verify the effectiveness of each improvement work of our framework.
引用
收藏
页数:20
相关论文
共 50 条
  • [1] Multimodal Graph Meta Contrastive Learning
    Zhao, Feng
    Wang, Donglin
    PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 3657 - 3661
  • [2] Graph contrastive learning with multiple information fusion
    Wang, Xiaobao
    Yang, Jun
    Wang, Zhiqiang
    He, Dongxiao
    Zhao, Jitao
    Huang, Yuxiao
    Jin, Di
    EXPERT SYSTEMS WITH APPLICATIONS, 2025, 268
  • [3] Graph Representation Learning In A Contrastive Framework For Community Detection
    Balouchi, Mehdi
    Ahmadi, Ali
    2021 26TH INTERNATIONAL COMPUTER CONFERENCE, COMPUTER SOCIETY OF IRAN (CSICC), 2021,
  • [4] Adaptive Graph Augmentation for Graph Contrastive Learning
    Wang, Zeming
    Li, Xiaoyang
    Wang, Rui
    Zheng, Changwen
    ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, ICIC 2023, PT IV, 2023, 14089 : 354 - 366
  • [5] Molecular graph contrastive learning with line graph
    Chen, Xueyuan
    Li, Shangzhe
    Liu, Ruomei
    Shi, Bowen
    Liu, Jiaheng
    Wu, Junran
    Xu, Ke
    PATTERN RECOGNITION, 2025, 162
  • [6] A Unique Framework of Heterogeneous Augmentation Graph Contrastive Learning for Both Node and Graph Classification
    Shao, Qi
    Chen, Duxin
    Yu, Wenwu
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2024, 11 (06): : 5818 - 5828
  • [7] A Review-aware Graph Contrastive Learning Framework for Recommendation
    Shuai, Jie
    Zhang, Kun
    Wu, Le
    Sun, Peijie
    Hong, Richang
    Wang, Meng
    Li, Yong
    PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, : 1283 - 1293
  • [8] Asymmetric Graph Contrastive Learning
    Chang, Xinglong
    Wang, Jianrong
    Guo, Rui
    Wang, Yingkui
    Li, Weihao
    MATHEMATICS, 2023, 11 (21)
  • [9] Hierarchical Graph Contrastive Learning
    Yan, Hao
    Wang, Senzhang
    Yin, Jun
    Li, Chaozhuo
    Zhu, Junxing
    Wang, Jianxin
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES: RESEARCH TRACK, ECML PKDD 2023, PT II, 2023, 14170 : 700 - 715
  • [10] Graph Contrastive Learning with Graph Info-Min
    Meng, En
    Liu, Yong
    PROCEEDINGS OF THE 32ND ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2023, 2023, : 4195 - 4199