Graph Contrastive Learning via Hierarchical Multiview Enhancement for Recommendation

被引:0
|
作者
Liu, Zhi [1 ,2 ]
Xiang, Hengjing [1 ,2 ]
Liang, Ruxia [1 ,2 ]
Xiang, Jinhai [3 ]
Wen, Chaodong [1 ,2 ]
Liu, Sannyuya [1 ,2 ]
Sun, Jianwen [1 ,2 ]
机构
[1] Cent China Normal Univ, Natl Engn Res Ctr Educ Big Data, Wuhan 430079, Peoples R China
[2] Cent China Normal Univ, Fac Artificial Intelligence Educ, Wuhan 430079, Peoples R China
[3] Huazhong Agr Univ, Coll informat, Wuhan 430070, Peoples R China
基金
中国国家自然科学基金;
关键词
Message passing; Recommender systems; Collaboration; Contrastive learning; Training; Robustness; Representation learning; Noise; Informatics; Data augmentation; Collaborative filtering (CF); contrastive learning (CL); graph neural networks (GNNs); multiple views; recommendation;
D O I
10.1109/TII.2024.3507185
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the field of recommender systems, self-supervised learning has become an effective framework. In response to the noisy interaction behaviors in realworld scenarios, as well as the skewed distribution influenced by data sparsity and popularity bias, graph contrastive learning has been introduced as a powerful self-supervised method in collaborative filtering (CF) to learn enhanced user and item representations. Despite their success, neither heuristic manual enhancement methods nor the use of final node representations to construct contrastive pairs are sufficient to provide effective and rich self-supervised signals to regulate the training process. Therefore, the learned representations of users and items are either fragile or lack heuristic guidance. In light of this, we propose the Hierarchical multiview graph contrastive learning framework HMCF, which leverages the message passing mechanism at the layer level to introduce different granularity levels of view augmentation using supervised signals, thus better enhancing the CF paradigm. HMCF leverages rich, high-quality self-supervised signals from different granularity views for accurate contrastive optimization, helping to alleviate data sparsity and noise issues. It also explains the hierarchical topology and relative distances between nodes in the original graph. Comprehensive experiments on three public datasets shows that our model significantly outperforms the state-of-the-art baselines.
引用
收藏
页码:2403 / 2412
页数:10
相关论文
共 50 条
  • [21] Temporal Graph Contrastive Learning for Sequential Recommendation
    Zhang, Shengzhe
    Chen, Liyi
    Wang, Chao
    Li, Shuangli
    Xiong, Hui
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 8, 2024, : 9359 - 9367
  • [22] Subgraph Collaborative Graph Contrastive Learning for Recommendation
    Ma, Jie
    Qin, Jiwei
    Ji, Peichen
    Yang, Zhibin
    Zhang, Donghao
    Liu, Chaoqun
    ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING-ICANN 2024, PT IX, 2024, 15024 : 105 - 120
  • [23] Graph Contrastive Learning with Knowledge Transfer for Recommendation
    Zhang, Baoxin
    Yang, Dan
    Liu, Yang
    Zhang, Yu
    ENGINEERING LETTERS, 2024, 32 (03) : 477 - 487
  • [24] FGCLR: An Effective Graph Contrastive Learning For Recommendation
    Wang, Hua-Wei
    Guo, Yi-Jing
    Weng, Wei
    Wu, Liu-Xi
    Yan, Zhong-Qi
    Journal of Network Intelligence, 2024, 9 (01): : 289 - 299
  • [25] Globally Informed Graph Contrastive Learning for Recommendation
    Zheng, Yixing
    Li, Chengxi
    Dong, Junyu
    Yu, Yanwei
    ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, PT XIII, ICIC 2024, 2024, 14874 : 274 - 286
  • [26] Graph Contrastive Learning with Adaptive Augmentation for Recommendation
    Jing, Mengyuan
    Zhu, Yanmin
    Zang, Tianzi
    Yu, Jiadi
    Tang, Feilong
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2022, PT I, 2023, 13713 : 590 - 605
  • [27] Graph Contrastive Learning With Negative Propagation for Recommendation
    Liu, Meishan
    Jian, Meng
    Bai, Yulong
    Wu, Jiancan
    Wu, Lifang
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2024, 11 (03) : 4255 - 4266
  • [28] Robust Basket Recommendation via Noise-tolerated Graph Contrastive Learning
    He, Xinrui
    Wei, Tianxin
    He, Jingrui
    PROCEEDINGS OF THE 32ND ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2023, 2023, : 709 - 719
  • [29] Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendation
    Yu, Junliang
    Yin, Hongzhi
    Xia, Xin
    Chen, Tong
    Cui, Lizhen
    Nguyen, Quoc Viet Hung
    PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, : 1294 - 1303
  • [30] Web Semantic-Based Robust Graph Contrastive Learning for Recommendation via Invariant Learning
    Dai, Wengui
    Wang, Yujun
    INTERNATIONAL JOURNAL ON SEMANTIC WEB AND INFORMATION SYSTEMS, 2024, 20 (01)