Heterogeneous information-based self-supervised graph learning for recommendation

被引:0
|
作者
Zhang, Bao [1 ]
Xu, Hongzhen [1 ]
Shuang, Ruijun [2 ]
Wang, Kafeng [3 ]
机构
[1] East China Univ Technol, Sch Software, 418 GuangLan St, Nanchang 330013, Jiangxi, Peoples R China
[2] East China Univ Technol, Sch Informat Engn, 418 Guanglan St, Nanchang 330013, Jiangxi, Peoples R China
[3] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
来源
JOURNAL OF SUPERCOMPUTING | 2025年 / 81卷 / 04期
基金
中国国家自然科学基金;
关键词
Recommendation models; Graph convolutional networks; Heterogeneous graph learning; Contrast learning; Information fusion;
D O I
10.1007/s11227-024-06898-w
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, graph neural networks (GNNs) have become a powerful tool for graph representation in recommendation systems. However, in real recommendation systems that often involve heterogeneous graph data, existing recommendation models find it difficult to learn accurate embedding representations from heterogeneous graphs, leading to the degradation of recommendation model performance. To address these problems, this paper proposes a self-supervised graph learning recommendation model (HSGL) based on heterogeneous information. Firstly, a lightweight graph convolution operation is used to complete feature embedding propagation learning in heterogeneous graphs, secondly, a semantic fusion module is designed to map the embeddings of heterogeneous relations into the same feature space, and a heterogeneous graph neural network is combined with self-supervised learning for feature representation enhancement through contrastive learning between different relations, and the final recommendation results are computed based on the fused feature vectors. Our extensive experiments on three real-world datasets show that the model in this paper outperforms various mainstream recommendation models while validating the effectiveness of key parts of the model.
引用
收藏
页数:26
相关论文
共 50 条
  • [31] Multi-behavior Enhanced Self-supervised Graph Learning for Social Recommendation
    Liu, Shiwei
    Xu, Yong
    PROCEEDINGS OF THE 2024 27 TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, CSCWD 2024, 2024, : 1092 - 1097
  • [32] Self-supervised graph transformer networks for social recommendation
    Li, Qinyao
    Yang, Qimeng
    Tian, Shengwei
    Yu, Long
    COMPUTERS & ELECTRICAL ENGINEERING, 2025, 123
  • [33] Popularity-Debiased Graph Self-Supervised for Recommendation
    Li, Shanshan
    Hu, Xinzhuan
    Guo, Jingfeng
    Liu, Bin
    Qi, Mingyue
    Jia, Yutong
    ELECTRONICS, 2024, 13 (04)
  • [34] Self-Supervised Graph Attention Collaborative Filtering for Recommendation
    Zhu, Jiangqiang
    Li, Kai
    Peng, Jinjia
    Qi, Jing
    ELECTRONICS, 2023, 12 (04)
  • [35] Graph Adversarial Self-Supervised Learning
    Yang, Longqi
    Zhang, Liangliang
    Yang, Wenjing
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [36] Graph Self-Supervised Learning: A Survey
    Liu, Yixin
    Jin, Ming
    Pan, Shirui
    Zhou, Chuan
    Zheng, Yu
    Xia, Feng
    Yu, Philip S.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (06) : 5879 - 5900
  • [37] A Recommendation Algorithm Based on a Self-supervised Learning Pretrain Transformer
    Yu-Hao Xu
    Zhen-Hai Wang
    Zhi-Ru Wang
    Rong Fan
    Xing Wang
    Neural Processing Letters, 2023, 55 : 4481 - 4497
  • [38] Self-supervised scientific document recommendation based on contrastive learning
    Tan, Shicheng
    Zhang, Tao
    Zhao, Shu
    Zhang, Yanping
    SCIENTOMETRICS, 2023, 128 (09) : 5027 - 5049
  • [39] A Recommendation Algorithm Based on a Self-supervised Learning Pretrain Transformer
    Xu, Yu-Hao
    Wang, Zhen-Hai
    Wang, Zhi-Ru
    Fan, Rong
    Wang, Xing
    NEURAL PROCESSING LETTERS, 2023, 55 (04) : 4481 - 4497
  • [40] Self-supervised scientific document recommendation based on contrastive learning
    Shicheng Tan
    Tao Zhang
    Shu Zhao
    Yanping Zhang
    Scientometrics, 2023, 128 : 5027 - 5049