Knowledge-Aware Graph Self-Supervised Learning for Recommendation
-
Published:2023-12-02
Issue:23
Volume:12
Page:4869
-
ISSN:2079-9292
-
Container-title:Electronics
-
language:en
-
Short-container-title:Electronics
Author:
Li Shanshan12ORCID, Jia Yutong12, Wu You12, Wei Ning12, Zhang Liyan12, Guo Jingfeng12
Affiliation:
1. College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China 2. Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Qinhuangdao 066004, China
Abstract
Collaborative filtering (CF) based on graph neural networks (GNN) can capture higher-order relationships between nodes, which in turn improves recommendation performance. Although effective, GNN-based methods still face the challenges of sparsity and noise in real scenarios. In recent years, researchers have introduced graph self-supervised learning (SSL) techniques into CF to alleviate the sparse supervision problem. The technique first augments the data to obtain contrastive views and then utilizes the mutual information maximization to provide self-supervised signals for the contrastive views. However, the existing approaches based on graph self-supervised signals still face the following challenges: (i) Most of the works fail to effectively mine and exploit the supervised information from the item knowledge graph, resulting in suboptimal performance. (ii) Existing data augmentation methods are unable to fully exploit the potential of contrastive learning, because they primarily focus on the contrastive view of data structure changes and neglect the adjacent relationship among users and items. To address these issues, we propose a novel self-supervised learning approach, namely Knowledge-aware Graph Self-supervised Learning (KGSL). Specifically, we calculate node similarity based on semantic relations between items in the knowledge graph to generate a semantic-based item similarity graph. Then, the self-supervised learning contrast views are generated from both the user–item interaction graph and the item similarity graph, respectively. Maximization of the information from these contrastive views provides additional self-supervised signals to enhance the node representation capacity. Finally, we establish a joint training strategy for the self-supervised learning task and the recommendation task to further optimize the learning process of KGSL. Extensive comparative experiments as well as ablation experiments are conducted on three real-world datasets to verify the effectiveness of KGSL.
Funder
The S&T Program of Hebei
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Hardware and Architecture,Signal Processing,Control and Systems Engineering
Reference56 articles.
1. Wang, J., Louca, R., Hu, D., Cellier, C., Caverlee, J., and Hong, L. (2020, January 3–7). Time to Shop for Valentine’s Day: Shopping Occasions and Sequential Recommendation in E-commerce. Proceedings of the 13th International Conference on Web Search and Data Mining, Houston, TX, USA. 2. Liu, S., Chen, Z., Liu, H., and Hu, X. (2019, January 13–17). User-video co-attention network for personalized micro-video recommendation. Proceedings of the World Wide Web Conference, San Francisco, CA, USA. 3. User response prediction in online advertising;Gharibshah;ACM Comput. Surv. (CSUR),2021 4. Hu, Y., Koren, Y., and Volinsky, C. (2008, January 15–19). Collaborative filtering for implicit feedback datasets. Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, Pisa, Italy. 5. FairCF: Fairness-aware collaborative filtering;Shao;Sci. China Inf. Sci.,2022
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|