Personalized Learning Path Recommendation using Graph Reinforcement Learning

A learning path is a set of sequentially accessed learning resources or objects that help learners progress in their learning journey. Researchers have introduced a range of methodologies for personalizing learning paths in the last decade, employing various computational techniques and approaches. Advanced computational techniques like supervised and un-supervised machine learning algorithms are often used in predicting efficient and personalized learning paths. In this work, we present a learning path recommended system based on the learner’s current knowledge state using graph reinforcement learning. The start point and end point of the learning path are identified from the learner’s query and knowledge base. Then, a reinforcement learning algorithm is used over a search space represented by a corpus. The corpus is composed of learning objects and their interconnections, represented as a graph where each node is a learning object, and each edge represents the degree of relationship of two joining nodes. We employ the Q-learning algorithm to recommend an appropriate learning path for the user’s query that maximizes the use of their existing knowledge. An experimental study is performed on the Wikipedia corpus to discover different learning paths. The initial results are promising, which indicates the efficiency of the proposed methodology.

Authors

Institutions

Publication Details

Journal
Procedia Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1016/j.procs.2025.04.604
Citations
2
Primary Topic
Online Learning and Analytics
Type
article
Field-Weighted Citation Impact
3.39
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Personalized Learning Path Recommendation using Graph Reinforcement Learning

S.C. Haldar, Souvik Sengupta, Asit Kumar Das
2 citations
Procedia Computer Science
Online Learning and Analytics
3.39
article

Personalized Learning Path Recommendation using Graph Reinforcement Learning

S.C. Haldar, Souvik Sengupta, Asit Kumar Das
article en
2 citations

Abstract

A learning path is a set of sequentially accessed learning resources or objects that help learners progress in their learning journey. Researchers have introduced a range of methodologies for personalizing learning paths in the last decade, employing various computational techniques and approaches. Advanced computational techniques like supervised and un-supervised machine learning algorithms are often used in predicting efficient and personalized learning paths. In this work, we present a learning path recommended system based on the learner’s current knowledge state using graph reinforcement learning. The start point and end point of the learning path are identified from the learner’s query and knowledge base. Then, a reinforcement learning algorithm is used over a search space represented by a corpus. The corpus is composed of learning objects and their interconnections, represented as a graph where each node is a learning object, and each edge represents the degree of relationship of two joining nodes. We employ the Q-learning algorithm to recommend an appropriate learning path for the user’s query that maximizes the use of their existing knowledge. An experimental study is performed on the Wikipedia corpus to discover different learning paths. The initial results are promising, which indicates the efficiency of the proposed methodology.

Procedia Computer ScienceVol. 258
Aliah University (IN), Indian Institute of Engineering Science and Technology, Shibpur (IN)
Openalex Percentile: Top 7%
Online Learning and Analytics
3.39
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.