A Survey on Knowledge Graph-Based Recommender Systems

To solve the information explosion problem and enhance user experience in various online applications, recommender systems have been developed to model users' preferences. Although numerous efforts have been made toward more personalized recommendations, recommender systems still suffer from several challenges, such as data sparsity and cold-start problems. In recent years, generating recommendations with the knowledge graph as side information has attracted considerable interest. Such an approach can not only alleviate the above mentioned issues for a more accurate recommendation, but also provide explanations for recommended items. In this paper, we conduct a systematical survey of knowledge graph-based recommender systems. We collect recently published papers in this field, and group them into three categories, i.e., embedding-based methods, connection-based methods, and propagation-based methods. Also, we further subdivide each category according to the characteristics of these approaches. Moreover, we investigate the proposed algorithms by focusing on how the papers utilize the knowledge graph for accurate and explainable recommendation. Finally, we propose several potential research directions in this field.

Automated summary

Knowledge graph-based recommender systems have attracted considerable interest in recent years as a way to solve the challenges faced by traditional recommender systems. In this paper, a systematical survey of knowledge graph-based recommender systems is conducted, categorizing them into embedding-based, connection-based, and propagation-based methods. The paper also explores how these approaches utilize the knowledge graph for accurate and explainable recommendation, and proposes potential research directions in this field.