Optimizing learning paths: Course recommendations based on graph convolutional networks and learning styles

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Guodao Zhang , Xiaoyun Gao , Haiyang Ye , Junyi Zhu , Wenqian Lin , Zizhao Wu , Haijun Zhou , Zi Ye , Yisu Ge , Alireza Baghban
{"title":"Optimizing learning paths: Course recommendations based on graph convolutional networks and learning styles","authors":"Guodao Zhang ,&nbsp;Xiaoyun Gao ,&nbsp;Haiyang Ye ,&nbsp;Junyi Zhu ,&nbsp;Wenqian Lin ,&nbsp;Zizhao Wu ,&nbsp;Haijun Zhou ,&nbsp;Zi Ye ,&nbsp;Yisu Ge ,&nbsp;Alireza Baghban","doi":"10.1016/j.asoc.2025.113083","DOIUrl":null,"url":null,"abstract":"<div><div>With the rise of Massive Open Online Course (MOOC) platforms and the growing popularity of self-directed learning, an increasing number of learners are utilizing online platforms to access educational resources. While these extensive course resources offer learners diverse and accessible learning experiences, they also present challenges in personalized course selection. Traditional recommendation models often lack sufficient interpretability and fail to effectively leverage the interactive data generated during curriculum learning or account for the impact of individual learning styles on recommendations. To address these limitations, this study proposes a novel model, Course Recommendations based on Graph Convolutional Networks and Learning Styles to Optimize Learning Paths. Firstly, learner-course interaction data is recursively propagated through graph convolutional networks to generate predictive scores for courses. Secondly, a matching scale between courses and learning styles is established to compute similarity scores. Finally, the predictive scores and learning style similarity scores are integrated to achieve personalized course recommendations. The experimental results on the MOOCCube dataset demonstrate that CGCNLS significantly outperforms the baseline methods across multiple evaluation metrics, and the average performance of Precision, Recall and NDCG is improved by 6.94 %, 6.63 % and 7.98 %, respectively, under different Top-K Settings (K = 5, 10, 20, and 30), which can more effectively recommend courses for learners. The findings of this research provide robust support for further advancements in recommender systems and are expected to enhance the user experience and learning outcomes on online learning platforms.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"175 ","pages":"Article 113083"},"PeriodicalIF":7.2000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625003941","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

With the rise of Massive Open Online Course (MOOC) platforms and the growing popularity of self-directed learning, an increasing number of learners are utilizing online platforms to access educational resources. While these extensive course resources offer learners diverse and accessible learning experiences, they also present challenges in personalized course selection. Traditional recommendation models often lack sufficient interpretability and fail to effectively leverage the interactive data generated during curriculum learning or account for the impact of individual learning styles on recommendations. To address these limitations, this study proposes a novel model, Course Recommendations based on Graph Convolutional Networks and Learning Styles to Optimize Learning Paths. Firstly, learner-course interaction data is recursively propagated through graph convolutional networks to generate predictive scores for courses. Secondly, a matching scale between courses and learning styles is established to compute similarity scores. Finally, the predictive scores and learning style similarity scores are integrated to achieve personalized course recommendations. The experimental results on the MOOCCube dataset demonstrate that CGCNLS significantly outperforms the baseline methods across multiple evaluation metrics, and the average performance of Precision, Recall and NDCG is improved by 6.94 %, 6.63 % and 7.98 %, respectively, under different Top-K Settings (K = 5, 10, 20, and 30), which can more effectively recommend courses for learners. The findings of this research provide robust support for further advancements in recommender systems and are expected to enhance the user experience and learning outcomes on online learning platforms.
优化学习路径:基于图卷积网络和学习风格的课程推荐
随着大规模在线开放课程(MOOC)平台的兴起和自主学习的日益普及,越来越多的学习者利用网络平台获取教育资源。这些丰富的课程资源为学习者提供了多样化的学习体验,但也给个性化选课带来了挑战。传统的推荐模型往往缺乏足够的可解释性,不能有效地利用课程学习过程中产生的交互数据,也不能考虑个人学习风格对推荐的影响。为了解决这些限制,本研究提出了一个新的模型,基于图卷积网络和学习风格的课程推荐来优化学习路径。首先,通过图卷积网络递归传播学习者-课程交互数据,生成课程预测分数。其次,建立课程与学习风格的匹配量表,计算相似度分数。最后,将预测分数与学习风格相似分数相结合,实现个性化课程推荐。在MOOCCube数据集上的实验结果表明,CGCNLS在多个评价指标上都明显优于基线方法,在不同Top-K设置(K = 5、10、20和30)下,Precision、Recall和NDCG的平均性能分别提高了6.94 %、6.63 %和7.98 %,可以更有效地为学习者推荐课程。本研究的发现为推荐系统的进一步发展提供了强有力的支持,并有望增强在线学习平台上的用户体验和学习成果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信