Improving Knowledge-aware Recommendation with Multi-level Interactive Contrastive Learning

计算机科学 人工智能 图形 机器学习 自然语言处理 理论计算机科学
作者
Ding Zou,Wei Wei,Ziyang Wang,Xian-Ling Mao,Feida Zhu,Rui Fang,Dangyang Chen
标识
DOI:10.1145/3511808.3557358
摘要

Incorporating Knowledge Graphs (KG) into recommeder system as side information has attracted considerable attention. Recently, the technical trend of Knowledge-aware Recommendation (KGR) is to develop end-to-end models based on graph neural networks (GNNs). However, the extremely sparse user-item interactions significantly degrade the performance of the GNN-based models, from the following aspects: 1) the sparse interaction, itself, means inadequate supervision signals and limits the supervised GNN-based models; 2) the combination of sparse interactions (CF part) and redundant KG facts (KG part) further results in an unbalanced information utilization. Besides, the GNN paradigm aggregates local neighbors for node representation learning, while ignoring the non-local KG facts and making the knowledge extraction insufficient. Inspired by the recent success of contrastive learning in mining supervised signals from data itself, in this paper, we focus on exploring contrastive learning in KGR and propose a novel multi-level interactive contrastive learning mechanism, to alleviate the aforementioned challenges. Different from traditional contrastive learning methods which contrast nodes of two generated graph views, interactive contrastive mechanism conducts layer-wise self-supervised learning by contrasting layers of different parts within graphs, which is also an "interaction" action. Specifically, we first construct local and non-local graphs for user/item in KG, exploring more KG facts for KGR. Then an intra-graph level interactive contrastive learning is performed within each local/non-local graph, which contrasts layers of the CF and KG parts, for more consistent information leveraging. Besides, an inter-graph level interactive contrastive learning is performed between the local and non-local graphs, for sufficiently and coherently extracting non-local KG signals. Extensive experiments conducted on three benchmark datasets show the superior performance of our proposed method over the state-of-the-arts. The implementations are available at: https://github.com/CCIIPLab/KGIC.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
田様应助youbei采纳,获得10
1秒前
斯文败类应助youbei采纳,获得10
1秒前
尤静柏完成签到,获得积分10
1秒前
脑洞疼应助youbei采纳,获得10
1秒前
科研通AI6.4应助碧蓝之柔采纳,获得10
1秒前
123完成签到,获得积分10
2秒前
碧蓝新柔发布了新的文献求助100
5秒前
7秒前
彩色的不可完成签到,获得积分10
8秒前
14秒前
April完成签到,获得积分10
14秒前
16秒前
我是老大应助小栗子采纳,获得10
16秒前
科研通AI6.2应助小栗子采纳,获得10
16秒前
科研通AI2S应助小栗子采纳,获得10
16秒前
Owen应助小栗子采纳,获得10
16秒前
情怀应助小栗子采纳,获得10
16秒前
大模型应助小栗子采纳,获得10
17秒前
英俊的铭应助小栗子采纳,获得10
17秒前
李爱国应助小栗子采纳,获得10
17秒前
汉堡包应助小栗子采纳,获得150
17秒前
LL完成签到,获得积分10
17秒前
碧蓝静白完成签到,获得积分10
18秒前
20秒前
20秒前
cocodu发布了新的文献求助10
21秒前
Krositon发布了新的文献求助30
21秒前
lilili完成签到,获得积分10
22秒前
田T发布了新的文献求助10
24秒前
24秒前
24秒前
李健的小迷弟应助小栗子采纳,获得10
24秒前
铮铮铁骨发布了新的文献求助10
24秒前
烟花应助小栗子采纳,获得10
24秒前
陶醉世德发布了新的文献求助10
24秒前
爆米花应助小栗子采纳,获得10
24秒前
25秒前
CodeCraft应助小栗子采纳,获得10
25秒前
深情安青应助小栗子采纳,获得10
25秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Advanced Weaponeering Fourth Edition, Volume 2 1000
Weaponeering: An Introduction Fourth Edition, Volume 1 1000
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
Analytical Separation Science 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7546753
求助须知:如何正确求助?哪些是违规求助? 9130248
关于积分的说明 19507126
捐赠科研通 7141070
什么是DOI,文献DOI怎么找? 3259425
关于科研通互助平台的介绍 2426362
邀请新用户注册赠送积分活动 2247745