亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

KGTN: Knowledge Graph Transformer Network for explainable multi-category item recommendation

计算机科学 可解释性 图形 推荐系统 理论计算机科学 标杆管理 人工智能 机器学习 数据挖掘 业务 营销
作者
Chao Chang,Junming Zhou,Yu Weng,Xiangwei Zeng,Zhengyang Wu,Chang‐Dong Wang,Yong Tang
出处
期刊:Knowledge Based Systems [Elsevier BV]
卷期号:278: 110854-110854 被引量:35
标识
DOI:10.1016/j.knosys.2023.110854
摘要

Most existing methods for recommendation assume that all the items are of the same category. However, single-category recommendations are no longer sufficient to fulfill the diverse needs of users in the real world. Existing methods cannot be directly applied to recommend multiple categories of items due to the different properties and complex relationships among them. However, a drawback of these approaches is their assumption of a fixed and homogeneous data format, making them incapable of addressing the challenge of recommending multiple categories of items. Recommendation of multiple categories of items to users concurrently has become a challenging task. To tackle this problem, we design a novel method Knowledge Graph Transformer Network (KGTN) for explainable multi-category item recommendation, inspired by advances in knowledge graph in the field of recommendation. Knowledge graph and neural network methods have shown advantages in addressing recommendation problems in heterogeneous graph structures. This is because different categories of items have unique attributes and dimensions, which can be effectively represented and integrated by incorporating knowledge graph and graph neural network techniques. That is, our approach can handle heterogeneous collaborative knowledge graphs composed of users and items, and can mine hidden path relationships without defining original paths. In addition, its algorithmic process has interpretability. Specifically, graph transformer layer converts the heterogeneous input graph into a useful meta-path graph for recommended task; graph convolution layer learns the node representation on the new meta-path graph. Finally, we calculate the inner product of user and item vector representations to output the probability for the recommendation. At the same time, we use the critical path in the learned useful meta-path graph as the explanation. Comprehensive experiments on three datasets demonstrate that KGTN achieves state-of-the-art performance over existing baselines.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
2秒前
橙子完成签到,获得积分10
3秒前
李健的小迷弟应助乐乐侠采纳,获得10
6秒前
叶子发布了新的文献求助10
7秒前
eweawe发布了新的文献求助10
18秒前
yexv发布了新的文献求助10
21秒前
传奇3应助CZR123采纳,获得10
24秒前
zhang完成签到,获得积分10
31秒前
Suzi完成签到 ,获得积分10
33秒前
eweawe完成签到,获得积分20
36秒前
37秒前
乐乐侠发布了新的文献求助10
41秒前
桐夜完成签到 ,获得积分10
45秒前
优雅的大白菜完成签到 ,获得积分10
51秒前
乐乐侠完成签到,获得积分10
51秒前
1分钟前
1分钟前
1分钟前
1分钟前
FashionBoy应助科研通管家采纳,获得10
1分钟前
张三发布了新的文献求助10
1分钟前
ASIS完成签到,获得积分10
1分钟前
sy发布了新的文献求助30
1分钟前
Elias完成签到,获得积分10
1分钟前
1分钟前
wanci应助灰灰采纳,获得10
1分钟前
林冰完成签到 ,获得积分10
1分钟前
CZR123发布了新的文献求助10
1分钟前
Koi完成签到 ,获得积分10
1分钟前
疯狂的元芹完成签到,获得积分20
1分钟前
1分钟前
1分钟前
666完成签到 ,获得积分10
1分钟前
1分钟前
1分钟前
1分钟前
柳贯一发布了新的文献求助10
1分钟前
碎觉觉完成签到,获得积分10
2分钟前
十号信封完成签到,获得积分10
2分钟前
yayika完成签到 ,获得积分10
2分钟前
高分求助中
论现代体育科学研究的方法学特征 1000
Invited Discussant 63O and 64O 1000
Ideology and Meaning-Making under the Putin Regime 750
Safety Pharmacology 500
《KNN基无铅压电陶瓷电学性能优化与物理机理研究》 500
Petrology and Plate Tectonics 500
A Handbook of User Experience Research & Design in Libraries 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 计算机科学 化学工程 生物化学 物理 内科学 复合材料 催化作用 光电子学 物理化学 电极 细胞生物学 基因 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6908341
求助须知:如何正确求助?哪些是违规求助? 8601311
关于积分的说明 18257094
捐赠科研通 6314383
什么是DOI,文献DOI怎么找? 3065245
关于科研通互助平台的介绍 2089259
邀请新用户注册赠送积分活动 2042766