Knowledge-Aware Graph Self-Supervised Learning for Recommendation

被引:1
作者
Li, Shanshan [1 ,2 ]
Jia, Yutong [1 ,2 ]
Wu, You [1 ,2 ]
Wei, Ning [1 ,2 ]
Zhang, Liyan [1 ,2 ]
Guo, Jingfeng [1 ,2 ]
机构
[1] Yanshan Univ, Coll Informat Sci & Engn, Qinhuangdao 066004, Peoples R China
[2] Key Lab Comp Virtual Technol & Syst Integrat Hebei, Qinhuangdao 066004, Peoples R China
基金
中国国家自然科学基金;
关键词
self-supervised learning; knowledge graph; semantic similarity; recommendation;
D O I
10.3390/electronics12234869
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:23
相关论文
共 55 条
[1]   Counterfactual Graph Augmentation for Consumer Unfairness Mitigation in Recommender Systems [J].
Boratto, Ludovico ;
Fabbri, Francesco ;
Fenu, Gianni ;
Marras, Mirko ;
Medda, Giacomo .
PROCEEDINGS OF THE 32ND ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2023, 2023, :3753-3757
[2]  
Bordes A., 2013, ADV NEURAL INFORM PR, V26, P2787, DOI DOI 10.5555/2999792.2999923
[3]  
Chen L, 2020, AAAI CONF ARTIF INTE, V34, P27
[4]  
Chen Z., 2022, arXiv, DOI DOI 10.48550/ARXIV.2208.04222
[5]   Metapath-guided Heterogeneous Graph Neural Network for Intent Recommendation [J].
Fan, Shaohua ;
Zhu, Junxiong ;
Han, Xiaotian ;
Shi, Chuan ;
Hu, Linmei ;
Ma, Biyu ;
Li, Yongliang .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :2478-2486
[6]  
Fu H, 2021, AAAI CONF ARTIF INTE, V35, P12830
[7]  
Gao L, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P3378
[8]   User Response Prediction in Online Advertising [J].
Gharibshah, Zhabiz ;
Zhu, Xingquan .
ACM COMPUTING SURVEYS, 2022, 54 (03)
[9]  
Gutmann M, 2010, P 13 INT C ART INT S, P297
[10]  
Hamilton WL, 2017, ADV NEUR IN, V30