基于学习者模型的学习资源推荐研究

Long-Yau Lin, Fang Wang, Fang Wang
{"title":"基于学习者模型的学习资源推荐研究","authors":"Long-Yau Lin, Fang Wang, Fang Wang","doi":"10.1145/3582580.3582589","DOIUrl":null,"url":null,"abstract":"In the era of education big data, personalized learning has become the new normal of digital learning. As an important application direction of personalized learning system, learning resource recommendation is used to solve the problems of \"information overload\" and \"information maze\" caused by massive learning resources. This paper first constructs learner profile data based on learners' learning behavior, and uses GA-K-means algorithm to cluster learners according to the characteristic data of learner model, which effectively solves the cold start problem caused by untimely resource scoring. Finally, a learning resource recommendation method is designed from the three dimensions of consolidation, promotion and expansion, and N resources with the highest degree of fit are recommended to learners. The experimental results show that GA-K-means algorithm is significantly better than the traditional K-means clustering algorithm in stability and effectiveness, and the classification of learner groups is also in line with the actual situation, which can recommend personalized learning resources that meet the cognitive level for students.","PeriodicalId":138087,"journal":{"name":"Proceedings of the 2022 5th International Conference on Education Technology Management","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Learning Resource Recommendation Based on Learner Model\",\"authors\":\"Long-Yau Lin, Fang Wang, Fang Wang\",\"doi\":\"10.1145/3582580.3582589\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the era of education big data, personalized learning has become the new normal of digital learning. As an important application direction of personalized learning system, learning resource recommendation is used to solve the problems of \\\"information overload\\\" and \\\"information maze\\\" caused by massive learning resources. This paper first constructs learner profile data based on learners' learning behavior, and uses GA-K-means algorithm to cluster learners according to the characteristic data of learner model, which effectively solves the cold start problem caused by untimely resource scoring. Finally, a learning resource recommendation method is designed from the three dimensions of consolidation, promotion and expansion, and N resources with the highest degree of fit are recommended to learners. The experimental results show that GA-K-means algorithm is significantly better than the traditional K-means clustering algorithm in stability and effectiveness, and the classification of learner groups is also in line with the actual situation, which can recommend personalized learning resources that meet the cognitive level for students.\",\"PeriodicalId\":138087,\"journal\":{\"name\":\"Proceedings of the 2022 5th International Conference on Education Technology Management\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2022 5th International Conference on Education Technology Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3582580.3582589\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 5th International Conference on Education Technology Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3582580.3582589","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在教育大数据时代,个性化学习已成为数字化学习的新常态。学习资源推荐是个性化学习系统的一个重要应用方向,用于解决海量学习资源带来的“信息过载”和“信息迷宫”问题。本文首先根据学习者的学习行为构建学习者轮廓数据,并根据学习者模型的特征数据使用GA-K-means算法对学习者进行聚类,有效解决了资源评分不及时导致的冷启动问题。最后,从整合、推广、扩展三个维度设计学习资源推荐方法,向学习者推荐N个契合度最高的资源。实验结果表明,GA-K-means算法在稳定性和有效性上明显优于传统的K-means聚类算法,对学习者群体的分类也符合实际情况,可以为学生推荐符合认知水平的个性化学习资源。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Learning Resource Recommendation Based on Learner Model
In the era of education big data, personalized learning has become the new normal of digital learning. As an important application direction of personalized learning system, learning resource recommendation is used to solve the problems of "information overload" and "information maze" caused by massive learning resources. This paper first constructs learner profile data based on learners' learning behavior, and uses GA-K-means algorithm to cluster learners according to the characteristic data of learner model, which effectively solves the cold start problem caused by untimely resource scoring. Finally, a learning resource recommendation method is designed from the three dimensions of consolidation, promotion and expansion, and N resources with the highest degree of fit are recommended to learners. The experimental results show that GA-K-means algorithm is significantly better than the traditional K-means clustering algorithm in stability and effectiveness, and the classification of learner groups is also in line with the actual situation, which can recommend personalized learning resources that meet the cognitive level for students.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信