Computer Engineering and Applications ›› 2022, Vol. 58 ›› Issue (9): 168-174.DOI: 10.3778/j.issn.1002-8331.2011-0054

• Pattern Recognition and Artificial Intelligence • Previous Articles     Next Articles

Knowledge-Aware Recommendation Algorithm Combined with Attention Mechanism

ZHANG Xin,  LIU Siyuan, XU Yanling   

  1. College of Information, Liaoning University, Shenyang 110036, China
  • Online:2022-05-01 Published:2022-05-01



  1. 辽宁大学 信息学院,沈阳 110036

Abstract: The application of knowledge graphs in recommender systems has attracted more and more attention, which can effectively solve the data sparsity and cold start problems in recommender systems. However, when the existing path-based and embedded-based knowledge-aware recommendation algorithms merge entities in the knowledge graph to represent users, they do not consider that the importance of entities to users is not the same, and the recommendation results will be affected by unrelated entities. Aiming at the limitations of the existing methods, a new knowledge-aware recommendation algorithm combined with the attention mechanism is proposed, and an end-to-end framework for incorporating the knowledge graph into the recommendation system is given. From the user’s historical click items, multiple entity sets are expanded on the knowledge graph, and the user’s preference distribution is calculated through the attention mechanism, and the final click probability is predicted accordingly. Through comparative experiments with traditional recommendation algorithms on two real public data sets, the results show that this method has achieved significant improvement under the evaluation of multiple common indicators(such as AUC, ACC and Recall@top-K).

Key words: recommendation system, knowledge graph, attention mechanism, entity communication

摘要: 知识图谱在推荐系统中的应用越来越受重视,可以有效地解决推荐系统中存在的数据稀疏性和冷启动问题。但现有的基于路径和基于嵌入的知识感知推荐算法在合并知识图谱中的实体来表示用户时,并没有考虑到实体对于用户的重要性并不相同,推荐结果会受到无关实体的影响。针对现有方法的局限性,提出了一种新的结合注意力机制的知识感知推荐算法,并给出一种将知识图谱合并到推荐系统中的端到端框架。由用户的历史点击项在知识图谱上扩展出多个实体集,通过注意力机制来计算用户的偏好分布,据此预测最终的点击概率。通过在两个真实的公共数据集上与传统的推荐算法进行对比实验,结果表明,该方法在多个通用指标(例如AUC、ACC和Recall@top-K)的评估下均取得了明显提升。

关键词: 推荐系统, 知识图谱, 注意力机制, 实体传播