This paper studies recommender systems with knowledge graphs, which can effectively address the problems of data sparsity and cold start. Recently, a variety of methods have been developed for this problem, which generally try to learn effective representations of users and items and then match items to users according to their representations. Though these methods have been shown quite effective, they lack good explanations, which are critical to recommender systems. In this paper, we take a different route and propose generating recommendations by finding meaningful paths from users to items. Specifically, we formulate the problem as a sequential decision process, where the target user is defined as the initial state, and the edges on the graphs are defined as actions. We shape the rewards according to existing state-of-the-art methods and then train a policy function with policy gradient methods. Experimental results on three real-world datasets show that our proposed method not only provides effective recommendations but also offers good explanations.
翻译:本文用知识图表推荐系统,可以有效地解决数据宽广和冷冷的开始问题。最近,为这一问题制定了各种方法,通常试图学习用户和项目的有效表达方式,然后根据用户的表述方式对项目进行匹配。虽然这些方法已经证明相当有效,但它们缺乏对建议系统至关重要的良好解释。在本文件中,我们采取不同的途径,通过从用户到项目寻找有意义的路径提出建议。具体地说,我们将问题作为一个顺序决定过程来表述,将目标用户定义为初始状态,将图表的边缘定义为行动。我们根据现有最新方法制定奖励,然后用政策梯度方法培训政策函数。三个现实世界数据集的实验结果显示,我们提出的方法不仅提供了有效的建议,而且还提供了良好的解释。