Graph Contrastive Learning With Negative Propagation for Recommendation

被引:2
|
作者
Liu, Meishan [1 ]
Jian, Meng [1 ]
Bai, Yulong [1 ]
Wu, Jiancan [2 ]
Wu, Lifang [1 ]
机构
[1] Beijing Univ Technol, Fac Informat Technol, Beijing 100124, Peoples R China
[2] Univ Sci & Technol China, Dept Elect Engn & Informat Sci, Hefei 230026, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
Contrastive learning; graph convolution; recommender system; user interest;
D O I
10.1109/TCSS.2024.3356071
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Previous recommendation models build interest embeddings heavily relying on the observed interactions and optimize the embeddings with a contrast between the interactions and randomly sampled negative instances. To our knowledge, the negative interest signals remain unexplored in interest encoding, which merely serves losses for backpropagation. Besides, the sparse undifferentiated interactions inherently bring implicit bias in revealing users' interests, leading to suboptimal interest prediction. The negative interest signals would be a piece of promising evidence to support detailed interest modeling. In this work, we propose a perturbed graph contrastive learning with negative propagation (PCNP) for recommendation, which introduces negative interest to assist interest modeling in a contrastive learning (CL) architecture. An auxiliary channel of negative interest learning generates a contrastive graph by negative sampling and propagates complementary embeddings of users and items to encode negative signals. The proposed PCNP contrasts positive and negative embeddings to promote interest modeling for recommendation. Extensive experiments demonstrate the capability of PCNP using two-level CL to alleviate interaction sparsity and bias issues for recommendation.
引用
收藏
页码:4255 / 4266
页数:12
相关论文
共 50 条
  • [21] MDGCL: Message Dropout Graph Contrastive Learning for Recommendation
    Xu, Qijia
    Li, Wei
    Chen, Jingxin
    ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, PT III, ICIC 2024, 2024, 14864 : 60 - 71
  • [22] Quaternion-Based Graph Contrastive Learning for Recommendation
    Fang, Yaxing
    Zhao, Pengpeng
    Xian, Xuefeng
    Fang, Junhua
    Liu, Guanfeng
    Liu, Yanchi
    Sheng, Victor S.
    2022 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2022,
  • [23] Heterogeneous Graph Contrastive Learning with Attention Mechanism for Recommendation
    Li, Ruxing
    Yang, Dan
    Gong, Xi
    ENGINEERING LETTERS, 2024, 32 (10) : 1930 - 1938
  • [24] Mixed Augmentation Contrastive Learning for Graph Recommendation System
    Dong, Zhuolun
    Yang, Yan
    Zhong, Yingli
    WEB AND BIG DATA, APWEB-WAIM 2024, PT II, 2024, 14962 : 130 - 143
  • [25] Candidate-aware Graph Contrastive Learning for Recommendation
    He, Wei
    Sun, Guohao
    Lu, Jinhu
    Fang, Xiu Susie
    PROCEEDINGS OF THE 46TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, SIGIR 2023, 2023, : 1670 - 1679
  • [26] SSGCL: Simple Social Recommendation with Graph Contrastive Learning
    Duan, Zhihua
    Wang, Chun
    Zhong, Wending
    MATHEMATICS, 2024, 12 (07)
  • [27] Contrastive Graph Semantic Learning via prototype for recommendation
    Wen, Mi
    Wang, Hongwei
    Li, Weiwei
    Fan, Zizhu
    Yu, Xiaoqing
    INFORMATION SCIENCES, 2025, 699
  • [28] Higher-Order Graph Contrastive Learning for Recommendation
    Zheng, ZhenZhong
    Li, Jianxin
    Wu, Xiaoming
    Liu, Xiangzhi
    Pei, Lili
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT VI, DASFAA 2024, 2024, 14855 : 35 - 51
  • [29] Graph contrastive learning for recommendation with generative data augmentation
    Li, Xiaoge
    Wang, Yin
    Wang, Yihan
    An, Xiaochun
    MULTIMEDIA SYSTEMS, 2024, 30 (04)
  • [30] AsGCL: Attentive and Simple Graph Contrastive Learning for Recommendation
    Li, Jie
    Yang, Changchun
    APPLIED SCIENCES-BASEL, 2025, 15 (05):