RHCR: a reinforced heterogeneous knowledge graph for course recommendation

Optimizing learning paths to improve learning outcomes and learner engagement has always been a challenge in the field of personalized learning and online education. Traditional recommendation systems often suffer from limitations such as data sparsity and poor interpretability, which restrict the effectiveness of personalized recommendations. To address these issues, this paper proposes a novel course recommendation model-Reinforced Heterogeneous Knowledge Graph Reasoning for Course Recommendation (RHCR). Specifically, RHCR introduces a heterogeneous course knowledge graph to mitigate issues like sparse data and weak interactions, and formulates course path reasoning as a Markov Decision Process (MDP). By utilizing the Asynchronous Advantage Actor-Critic (A3C) algorithm enhanced with Multi-Head Attention and Bidirectional Long Short-Term Memory (MHA-BiLSTM), the model optimizes recommendation paths based on learners' profiles and historical course data. Experimental results show that RHCR increases Normalized Discounted Cumulative Gain (NDCG) by 8.16% and the Precision by 16.29% on the same dataset, outperforming traditional neural network-based methods. Moreover, it alleviates data sparsity and improves recommendation interpretability, providing an effective solution for personalized learning path optimization.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-06-12
DOI
https://doi.org/10.1038/s41598-026-56490-w
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RHCR: a reinforced heterogeneous knowledge graph for course recommendation

Qiaozhi Lei, Mingshan Xie, Zhiwen Li, Rongxin Li et al.
Scientific Reports
Advanced Graph Neural Networks
article

RHCR: a reinforced heterogeneous knowledge graph for course recommendation

Qiaozhi Lei, Mingshan Xie, Zhiwen Li, Rongxin Li, Yichun Zeng
article en

Abstract

Optimizing learning paths to improve learning outcomes and learner engagement has always been a challenge in the field of personalized learning and online education. Traditional recommendation systems often suffer from limitations such as data sparsity and poor interpretability, which restrict the effectiveness of personalized recommendations. To address these issues, this paper proposes a novel course recommendation model-Reinforced Heterogeneous Knowledge Graph Reasoning for Course Recommendation (RHCR). Specifically, RHCR introduces a heterogeneous course knowledge graph to mitigate issues like sparse data and weak interactions, and formulates course path reasoning as a Markov Decision Process (MDP). By utilizing the Asynchronous Advantage Actor-Critic (A3C) algorithm enhanced with Multi-Head Attention and Bidirectional Long Short-Term Memory (MHA-BiLSTM), the model optimizes recommendation paths based on learners' profiles and historical course data. Experimental results show that RHCR increases Normalized Discounted Cumulative Gain (NDCG) by 8.16% and the Precision by 16.29% on the same dataset, outperforming traditional neural network-based methods. Moreover, it alleviates data sparsity and improves recommendation interpretability, providing an effective solution for personalized learning path optimization.

Scientific Reports
Guizhou University (CN)
National Natural Science Foundation of China, Guizhou University
Openalex Percentile: Top 4%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.