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 条
  • [31] Simultaneously local and global contrastive learning of graph representations
    An, Shuai
    Hong, Binsheng
    Guo, Zhaori
    Zhu, Shunzhi
    Lin, Kaibiao
    Yang, Fan
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2025, 145
  • [32] Cross-view graph contrastive learning with hypergraph
    Zhu, Jianian
    Zeng, Weixin
    Zhang, Junfeng
    Tang, Jiuyang
    Zhao, Xiang
    INFORMATION FUSION, 2023, 99
  • [33] Features based adaptive augmentation for graph contrastive learning
    Ali, Adnan
    Li, Jinlong
    DIGITAL SIGNAL PROCESSING, 2024, 145
  • [34] Information-Controllable Graph Contrastive Learning for Recommendation
    Guo, Zirui
    Yu, Yanhua
    Wang, Yuling
    Lu, Kangkang
    Yang, Zixuan
    Pang, Liang
    Chua, Tat-Seng
    PROCEEDINGS OF THE EIGHTEENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS, RECSYS 2024, 2024, : 528 - 537
  • [35] Adaptive denoising graph contrastive learning with memory graph attention for recommendation
    Ma, Gang-Feng
    Yang, Xu-Hua
    Gao, Liang-Yu
    Lian, Ling-Hang
    NEUROCOMPUTING, 2024, 610
  • [36] Graph Contrastive Learning With Adaptive Proximity-Based Graph Augmentation
    Zhuo, Wei
    Tan, Guang
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (10) : 14301 - 14314
  • [37] PAGCL: An unsupervised graph poisoned attack for graph contrastive learning model
    Li, Qing
    Wang, Ziyue
    Li, Zehao
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2023, 149 : 240 - 249
  • [38] Contrastive learning for fair graph representations via counterfactual graph augmentation
    Li, Chengyu
    Cheng, Debo
    Zhang, Guixian
    Zhang, Shichao
    KNOWLEDGE-BASED SYSTEMS, 2024, 305
  • [39] Graph Contrastive Learning Method with Sample Disparity Constraint and Feature Structure Graph for Node Classification
    Chen, Gangbin
    Cheng, Junwei
    Liang, Wanying
    He, Chaobo
    Tang, Yong
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, PT IV, KSEM 2023, 2023, 14120 : 291 - 303
  • [40] Graph Contrastive Learning with Generative Adversarial Network
    Wu, Cheng
    Wang, Chaokun
    Xu, Jingcao
    Liu, Ziyang
    Zheng, Kai
    Wang, Xiaowei
    Song, Yang
    Gai, Kun
    PROCEEDINGS OF THE 29TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2023, 2023, : 2721 - 2730