arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.03166cs.IR

面向知识图谱可解释推荐的类别感知双智能体强化学习模型

CADRL: Category-aware Dual-agent Reinforcement Learning for Explainable Recommendations over Knowledge Graphs

Shangfei Zheng, Hongzhi Yin, Tong Chen, Xiangjie Kong, Jian Hou, Pengpeng Zhao

AI总结:

针对知识图谱推荐中可解释路径生成不足与长路径遍历效率低的问题,提出类别感知双智能体强化学习模型CADRL,通过类别感知门控图神经网络和双智能体框架提升推荐效果与效率。

摘要:

知识图谱(KGs)已被广泛用于缓解推荐系统中的数据稀疏问题并解决冷启动问题。虽然现有的基于知识图谱的推荐方法能够预测用户偏好和需求,但它们在生成显式推荐路径方面存在不足,缺乏可解释性。作为对上述方法的进一步推进,近期研究利用强化学习(RL)通过可解释推荐路径为给定用户寻找合适的物品。然而,这些方案的性能仍受以下两点限制:(1)缺乏从邻域信息中捕获上下文依赖关系的能力;(2)出于效率考虑过度依赖短推荐路径。为克服这些挑战,我们提出了一种面向知识图谱可解释推荐的类别感知双智能体强化学习(CADRL)模型。具体而言,我们的模型包含两个组件:(1)一个类别感知的门控图神经网络,联合从邻域实体和类别中捕获上下文感知的物品表示;(2)一个双智能体强化学习框架,其中两个智能体高效地遍历长路径以搜索合适的物品。最后,实验结果表明,在大规模数据集上,CADRL在有效性和效率方面均优于最先进的模型。

英文摘要:

Knowledge graphs (KGs) have been widely adopted to mitigate data sparsity and address cold-start issues in recommender systems. While existing KGs-based recommendation methods can predict user preferences and demands, they fall short in generating explicit recommendation paths and lack explainability. As a step beyond the above methods, recent advancements utilize reinforcement learning (RL) to find suitable items for a given user via explainable recommendation paths. However, the performance of these solutions is still limited by the following two points. (1) Lack of ability to capture contextual dependencies from neighboring information. (2) The excessive reliance on short recommendation paths due to efficiency concerns. To surmount these challenges, we propose a category-aware dual-agent reinforcement learning (CADRL) model for explainable recommendations over KGs. Specifically, our model comprises two components: (1) a category-aware gated graph neural network that jointly captures context-aware item representations from neighboring entities and categories, and (2) a dual-agent RL framework where two agents efficiently traverse long paths to search for suitable items. Finally, experimental results show that CADRL outperforms state-of-the-art models in terms of both effectiveness and efficiency on large-scale datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑