Knowledge Graph Driven Recommendation System Algorithm

Chaoyang Zhang, Yanan Li, Shen Chen, Siwei Fan, Wei Li
12/1/2023
cs.IRcs.CL

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

In this paper, we propose a novel graph neural network-based recommendation model called KGLN, which leverages Knowledge Graph (KG) information to enhance the accuracy and effectiveness of personalized recommendations. We first use a single-layer neural network to merge individual node features in the graph, and then adjust the aggregation weights of neighboring entities by incorporating influence factors. The model evolves from a single layer to multiple layers through iteration, enabling entities to access extensive multi-order associated entity information. The final step involves integrating features of entities and users to produce a recommendation score. The model performance was evaluated by comparing its effects on various aggregation methods and influence factors. In tests over the MovieLen-1M and Book-Crossing datasets, KGLN shows an Area Under the ROC curve (AUC) improvement of 0.3% to 5.9% and 1.1% to 8.2%, respectively, which is better than existing benchmark methods like LibFM, DeepFM, Wide&Deep, and RippleNet.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zhang2023knowledge,
  title  = {Knowledge Graph Driven Recommendation System Algorithm},
  author = {Chaoyang Zhang and Yanan Li and Shen Chen and Siwei Fan and Wei Li},
  year   = {2023},
  eprint = {2401.10244},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.10244v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.10244.svg)](https://codeofpaper.com/paper/2401.10244)

Discussion