Explainable exercise recommendation with knowledge graph

Recommending suitable exercises and providing the reasons for these recommendations is a highly valuable task, as it can significantly improve students' learning efficiency. Nevertheless, the extensive range of exercise resources and the diverse learning capacities of students present a notable difficulty in recommending exercises. Collaborative filtering approaches frequently have difficulties in recommending suitable exercises, whereas deep learning methods lack explanation, which restricts their practical use. To address these issue, this paper proposes KG4EER, an explainable exercise recommendation with a knowledge graph. KG4EER facilitates the matching of various students with suitable exercises and offers explanations for its recommendations. More precisely, a feature extraction module is introduced to represent students' learning features, and a knowledge graph is constructed to recommend exercises. This knowledge graph, which includes three primary entities - knowledge concepts, students, and exercises - and their interrelationships, serves to recommend suitable exercises. Extensive experiments conducted on three real-world datasets, coupled with expert interviews, establish the superiority of KG4EER over existing baseline methods and underscore its robust explainability.

Authors

Institutions

Publication Details

Journal
Neural Networks
Published
2024-12-06
DOI
https://doi.org/10.1016/j.neunet.2024.106954
Citations
14
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
4.86

Funders

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

Explainable exercise recommendation with knowledge graph

Zhuzhou Li, Weiqi Luo, Chaobo He, Fang Xiao et al.
14 citations
Neural Networks
Advanced Graph Neural Networks
4.86
article

Explainable exercise recommendation with knowledge graph

Zhuzhou Li, Weiqi Luo, Chaobo He, Fang Xiao, Zhiguo Gong, Liangda Fang, Guanliang Chen, Xinghe Cheng, Quanlong Guan
article en
14 citations

Abstract

Recommending suitable exercises and providing the reasons for these recommendations is a highly valuable task, as it can significantly improve students' learning efficiency. Nevertheless, the extensive range of exercise resources and the diverse learning capacities of students present a notable difficulty in recommending exercises. Collaborative filtering approaches frequently have difficulties in recommending suitable exercises, whereas deep learning methods lack explanation, which restricts their practical use. To address these issue, this paper proposes KG4EER, an explainable exercise recommendation with a knowledge graph. KG4EER facilitates the matching of various students with suitable exercises and offers explanations for its recommendations. More precisely, a feature extraction module is introduced to represent students' learning features, and a knowledge graph is constructed to recommend exercises. This knowledge graph, which includes three primary entities - knowledge concepts, students, and exercises - and their interrelationships, serves to recommend suitable exercises. Extensive experiments conducted on three real-world datasets, coupled with expert interviews, establish the superiority of KG4EER over existing baseline methods and underscore its robust explainability.

Neural NetworksVol. 183
Jinan University (CN), South China Normal University (CN), University of Macau (MO), Monash Health (AU), Monash University (AU)
National Natural Science Foundation of China, Jinan University, Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 4%
Advanced Graph Neural Networks
4.86
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.