KnowPath: An LLM-Supported Knowledge Graph Construction and Path Finding Framework to Explainable MOOC Recommendations

The proliferation of Massive Open Online Courses (MOOCs) has created an urgent need for advanced course recommendation systems (RS). Course recommendations in MOOCs require transparent motivations to justify course selection, as there are often many courses with the same title, but which vary widely in content, duration, learning resources provided, and the academic authority of the instructor. Explainable recommendations are crucial to ensure that recommended courses fit well with learners’ needs and increase the chance of successful course completion, but unfortunately existing RS for MOOCs struggle to provide explainable recommendations. In this article, we present KnowPath , a novel RS for MOOCs, which generates effective and explainable recommendations. KnowPath uses open source Large Language Models (LLMs) to construct knowledge graphs (KGs) capable of accurately capturing complex relationships between MOOC entities (e.g., learners, instructors, educational resources) and employs Reinforcement Learning to align the output of an LLM with learner preferences. Extensive experiments on two public datasets (XueTang and COCO) demonstrate the superior performance and generalizability of KnowPath , underlining its potential to revolutionize the field of personalized online education.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Information Systems
Published
2025-12-12
DOI
https://doi.org/10.1145/3779436
Citations
1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

KnowPath: An LLM-Supported Knowledge Graph Construction and Path Finding Framework to Explainable MOOC Recommendations

Pasquale De Meo, Jia Zhu, Zhongmei Han, Jueqi Guan et al.
1 citations
ACM Transactions on Information Systems
Advanced Graph Neural Networks
2.48
article

KnowPath: An LLM-Supported Knowledge Graph Construction and Path Finding Framework to Explainable MOOC Recommendations

Pasquale De Meo, Jia Zhu, Zhongmei Han, Jueqi Guan, Weijie Shi, Zhiping Chen
article en
1 citations

Abstract

The proliferation of Massive Open Online Courses (MOOCs) has created an urgent need for advanced course recommendation systems (RS). Course recommendations in MOOCs require transparent motivations to justify course selection, as there are often many courses with the same title, but which vary widely in content, duration, learning resources provided, and the academic authority of the instructor. Explainable recommendations are crucial to ensure that recommended courses fit well with learners’ needs and increase the chance of successful course completion, but unfortunately existing RS for MOOCs struggle to provide explainable recommendations. In this article, we present KnowPath , a novel RS for MOOCs, which generates effective and explainable recommendations. KnowPath uses open source Large Language Models (LLMs) to construct knowledge graphs (KGs) capable of accurately capturing complex relationships between MOOC entities (e.g., learners, instructors, educational resources) and employs Reinforcement Learning to align the output of an LLM with learner preferences. Extensive experiments on two public datasets (XueTang and COCO) demonstrate the superior performance and generalizability of KnowPath , underlining its potential to revolutionize the field of personalized online education.

ACM Transactions on Information SystemsVol. 44(2)
University of Messina (IT), Zhejiang Normal University (CN), Hong Kong University of Science and Technology (HK)
Openalex Percentile: Top 8%
Advanced Graph Neural Networks
2.48
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.