.png){kind=icon}
.png){kind=icon}
Return
AGRE: A knowledge graph recommendation algorithm based on multiple paths embeddings RNN encoder
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2022.110078.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
More and more researches have focused on the use of knowledge graphs (KG) to solve the sparsity problem of traditional collaborative filtering recommendation systems. Most KG based recommen-dation algorithms focus on independent paths connecting users and items, or iteratively propagate user preferences in KG. However, the current approachs that focus on indedpent paths ignore the association between paths. Therefore, in this study, we propose a knowledge graph recommendation system algorithm for the multiple paths RNN encoder (AGRE), which fully considers the association between paths. Specifically, the paths between the user and the item are coded by a specified RNN (MRNN) to accurately learn the user's preferences. Traditional RNNs can encode multiple paths without considering the association between paths, but our RNN can encode multiple paths with considering the association between paths. We have compared AGRE with other state-of-the-art algorithms on three real-world datasets, and achieved good results in terms of AUC and Precision@K. This indicates that AGRE could solve the problem of sparse interaction between users and items, and could make full use of the knowledge graph for recommendation.(c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Knowledge graph
Recommendation algorithm
Multiple paths
MRNN
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W