Enhanced knowledge graph recommendation algorithm based on multi-level contrastive learning

doi:10.1038/s41598-024-74516-z

Return

Enhanced knowledge graph recommendation algorithm based on multi-level contrastive learning

2024-10-04

张荣 (Rong Zhang) *

Yuan Liu

Yang, Li

DOI：10.1038/s41598-024-74516-z

Original

Save

View PDF

Abstract

En 中文

Integrating the Knowledge Graphs (KGs) into recommendation systems enhances personalization and accuracy. However, the long-tail distribution of knowledge graphs often leads to data sparsity, which limits the effectiveness in practical applications. To address this challenge, this study proposes a knowledge-aware recommendation algorithm framework that incorporates multi-level contrastive learning. This framework enhances the Collaborative Knowledge Graph (CKG) through a random edge dropout method, which constructs feature representations at three levels: user-user interactions, item-item interactions and user-item interactions. A dynamic attention mechanism is employed in the Graph Attention Networks (GAT) for modeling the KG. Combined with the nonlinear transformation and Momentum Contrast (Moco) strategy for contrastive learning, it can effectively extract high-quality feature information. Additionally, multi-level contrastive learning, as an auxiliary self-supervised task, is jointly trained with the primary supervised task, which further enhances recommendation performance. Experimental results on the MovieLens and Amazon-books datasets demonstrate that this framework effectively improves the performance of knowledge graph-based recommendations, addresses the issue of data sparsity, and outperforms other baseline models across multiple evaluation metrics.

Keywords:

Recommendation system

Knowledge graph

Knowledge-aware recommendation

Contrastive learning

Graph Neural Network (GNN)

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.