Abstract

Nowadays, personalized recommendation based on knowledge graphs has become a hot spot for researchers due to its good recommendation effect. In this paper, we researched personalized recommendation based on knowledge graphs. First of all, we study the knowledge graphs’ construction method and complete the construction of the movie knowledge graphs. Furthermore, we use Neo4j graph database to store the movie data and vividly display it. Then, the classical translation model TransE algorithm in knowledge graph representation learning technology is studied in this paper, and we improved the algorithm through a cross-training method by using the information of the neighboring feature structures of the entities in the knowledge graph. Furthermore, the negative sampling process of TransE algorithm is improved. The experimental results show that the improved TransE model can more accurately vectorize entities and relations. Finally, this paper constructs a recommendation model by combining knowledge graphs with ranking learning and neural network. We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-BPR) and the neural network recommendation model based on knowledge graphs (KG-NN). The semantic information of entities and relations in knowledge graphs is embedded into vector space by using improved TransE method, and we compare the results. The item entity vectors containing external knowledge information are integrated into the BPR model and neural network, respectively, which make up for the lack of knowledge information of the item itself. Finally, the experimental analysis is carried out on MovieLens-1M data set. The experimental results show that the two recommendation models proposed in this paper can effectively improve the accuracy, recall, F1 value and MAP value of recommendation.

Highlights

  • We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-Bayesian Personalized Ranking (BPR))

  • With the widespread application of information technology, the information contained in the network has grown rapidly, which has brought about information overload and information confusion

  • The loss function is shown in Formula (5), where E represents the set of entities in the knowledge graphs, and N (t) represents the adjacent structure information of the specific entity node t, that is, the input data of the neural network

Read more

Summary

Introduction

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. The first method combines the knowledge graphs and Bayesian personalized ranking, introduces the movie entity vector matrix in ranking learning to help generate the user feature matrix and movie feature matrix in BPR ranking model. It applies them in the scoring prediction process.

Related Works
Knowledge Base Construction
Building a Knowledge Graph Based on Neo4j
Movie Recommendation Model Based on Knowledge Graph Representation Learning
TransE Algorithm Introduction
Improvement of Negative Triples Construction Method
Extraction Method
Training Process Improvement
Improved Algorithm
KG-BPR Recommend Model
KG-NN Recommend Model
Experiment Setup
Analysis of Results
KG-BPR Experiment Results and Analysis
KG-NN Experiment Results and Analysis
Discussion and Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call