A Survey on Knowledge Graph-Based Recommender Systems
- URL: http://arxiv.org/abs/2003.00911v1
- Date: Fri, 28 Feb 2020 02:26:30 GMT
- Title: A Survey on Knowledge Graph-Based Recommender Systems
- Authors: Qingyu Guo, Fuzhen Zhuang, Chuan Qin, Hengshu Zhu, Xing Xie, Hui Xiong
and Qing He
- Abstract summary: We conduct a systematical survey of knowledge graph-based recommender systems.
We focus on how the papers utilize the knowledge graph for accurate and explainable recommendation.
We introduce datasets used in these works.
- Score: 65.50486149662564
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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. In recent years, generating
recommendations with the knowledge graph as side information has attracted
considerable interest. Such an approach can not only alleviate the
abovementioned 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 summarize them from two perspectives. On the
one hand, we investigate the proposed algorithms by focusing on how the papers
utilize the knowledge graph for accurate and explainable recommendation. On the
other hand, we introduce datasets used in these works. Finally, we propose
several potential research directions in this field.
Related papers
- Review of Explainable Graph-Based Recommender Systems [2.1711205684359247]
This review paper discusses state-of-the-art approaches of explainable graph-based recommender systems.
It categorizes them based on three aspects: learning methods, explaining methods, and explanation types.
arXiv Detail & Related papers (2024-07-31T21:30:36Z) - Embedding in Recommender Systems: A Survey [67.67966158305603]
A crucial aspect is embedding techniques that covert the high-dimensional discrete features, such as user and item IDs, into low-dimensional continuous vectors.
Applying embedding techniques captures complex entity relationships and has spurred substantial research.
This survey covers embedding methods like collaborative filtering, self-supervised learning, and graph-based techniques.
arXiv Detail & Related papers (2023-10-28T06:31:06Z) - Impression-Aware Recommender Systems [57.38537491535016]
Novel data sources bring new opportunities to improve the quality of recommender systems.
Researchers may use impressions to refine user preferences and overcome the current limitations in recommender systems research.
We present a systematic literature review on recommender systems using impressions.
arXiv Detail & Related papers (2023-08-15T16:16:02Z) - A Personalized Recommender System Based-on Knowledge Graph Embeddings [0.0]
The recent emergence in interest for using knowledge graphs as a form of information modeling has led to their increased adoption in recommender systems.
By incorporating relevant users and relevant items into the knowledge graph, these systems can better capture the implicit connections between them and provide more accurate recommendations.
arXiv Detail & Related papers (2023-07-20T08:14:06Z) - Recommender systems based on graph embedding techniques: A comprehensive
review [9.871096870138043]
This article systematically retrospects graph embedding-based recommendation from embedding techniques for bipartite graphs, general graphs, and knowledge graphs.
Comparing several representative graph embedding-based recommendation models with the most common-used conventional recommendation models, on simulations, manifests that the conventional models overall outperform the graph embedding-based ones in predicting implicit user-item interactions.
arXiv Detail & Related papers (2021-09-20T14:42:39Z) - Rating and aspect-based opinion graph embeddings for explainable
recommendations [69.9674326582747]
We propose to exploit embeddings extracted from graphs that combine information from ratings and aspect-based opinions expressed in textual reviews.
We then adapt and evaluate state-of-the-art graph embedding techniques over graphs generated from Amazon and Yelp reviews on six domains, outperforming baseline recommenders.
arXiv Detail & Related papers (2021-07-07T14:07:07Z) - Graphing else matters: exploiting aspect opinions and ratings in
explainable graph-based recommendations [66.83527496838937]
We propose to exploit embeddings extracted from graphs that combine information from ratings and aspect-based opinions expressed in textual reviews.
We then adapt and evaluate state-of-the-art graph embedding techniques over graphs generated from Amazon and Yelp reviews on six domains.
Our approach has the advantage of providing explanations which leverage aspect-based opinions given by users about recommended items.
arXiv Detail & Related papers (2021-07-07T13:57:28Z) - Knowledge Transfer via Pre-training for Recommendation: A Review and
Prospect [89.91745908462417]
We show the benefits of pre-training to recommender systems through experiments.
We discuss several promising directions for future research for recommender systems with pre-training.
arXiv Detail & Related papers (2020-09-19T13:06:27Z) - Recommendation system using a deep learning and graph analysis approach [1.2183405753834562]
We propose a novel recommendation method based on Matrix Factorization and graph analysis methods.
In addition, we leverage deep Autoencoders to initialize users and items latent factors, and deep embedding method gathers users' latent factors from the user trust graph.
arXiv Detail & Related papers (2020-04-17T08:05:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.