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 条
  • [1] Hierarchical Graph Contrastive Learning for Review-Enhanced Recommendation
    Shui, Changsheng
    Li, Xiang
    Qi, Jianpeng
    Jiang, Guiyuan
    Yu, Yanwei
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES-RESEARCH TRACK, PT VI, ECML PKDD 2024, 2024, 14946 : 423 - 440
  • [2] Hierarchical neighbor-enhanced graph contrastive learning for recommendation
    Wei, Hongjie
    Wang, Junli
    Ji, Yu
    Guang, Mingjian
    Yan, Chungang
    KNOWLEDGE-BASED SYSTEMS, 2025, 315
  • [3] Contrastive Graph Semantic Learning via prototype for recommendation
    Wen, Mi
    Wang, Hongwei
    Li, Weiwei
    Fan, Zizhu
    Yu, Xiaoqing
    INFORMATION SCIENCES, 2025, 699
  • [4] Contrastive Graph Structure Learning via Information Bottleneck for Recommendation
    Wei, Chunyu
    Liang, Jian
    Liu, Di
    Wang, Fei
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
  • [5] NPGCL: neighbor enhancement and embedding perturbation with graph contrastive learning for recommendation
    Wu, Xing
    Wang, Haodong
    Yao, Junfeng
    Qian, Quan
    Song, Jun
    APPLIED INTELLIGENCE, 2025, 55 (06)
  • [6] 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
  • [7] Prototypical Graph Contrastive Learning for Recommendation
    Wei, Tao
    Yang, Changchun
    Zheng, Yanqi
    APPLIED SCIENCES-BASEL, 2025, 15 (04):
  • [8] Adaptive Graph Contrastive Learning for Recommendation
    Jiang, Yangqin
    Huang, Chao
    Xia, Lianghao
    PROCEEDINGS OF THE 29TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2023, 2023, : 4252 - 4261
  • [9] Contrastive Graph Learning for Social Recommendation
    Zhang, Yongshuai
    Huang, Jiajin
    Li, Mi
    Yang, Jian
    FRONTIERS IN PHYSICS, 2022, 10
  • [10] HKGCL: Hierarchical graph contrastive learning for multi-domain recommendation over knowledge graph
    Li, Yakun
    Hou, Lei
    Li, Dongmei
    Li, Juanzi
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 233