基于机器学习的运动推荐方法

Zhizhuang Li, Haiyang Hu, Zhipeng Xia, Jianping Zhang, Xiaoli Li, Zisihan Wang, Xiaoke Huang, Shan Zeng, Beixu Qiu
{"title":"基于机器学习的运动推荐方法","authors":"Zhizhuang Li, Haiyang Hu, Zhipeng Xia, Jianping Zhang, Xiaoli Li, Zisihan Wang, Xiaoke Huang, Shan Zeng, Beixu Qiu","doi":"10.1109/ICALT52272.2021.00023","DOIUrl":null,"url":null,"abstract":"This paper presents a method of exercises recommendation based on machine learning. This method can recommend more suitable exercises to students according to the category they belong to. Firstly, we use linear regression and EM algorithm to accurately model the students' mastery of each knowledge point. For each knowledge point, students are divided into several categories according to their mastery of the knowledge point and their average mastery of all knowledge points. For each knowledge point, according to the student history answer record, find out the exercise that can make each kind of student get bigger promotion respectively. For the students who need to recommend the exercises that contain the specified knowledge points, we first use the k-nearest neighbor algorithm to classify the students, and then recommend the exercises suitable for the students. It has been proved by experiments that this method can help students to achieve greater improvement in the same number of exercises.","PeriodicalId":170895,"journal":{"name":"2021 International Conference on Advanced Learning Technologies (ICALT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Exercise Recommendation Method Based on Machine Learning\",\"authors\":\"Zhizhuang Li, Haiyang Hu, Zhipeng Xia, Jianping Zhang, Xiaoli Li, Zisihan Wang, Xiaoke Huang, Shan Zeng, Beixu Qiu\",\"doi\":\"10.1109/ICALT52272.2021.00023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a method of exercises recommendation based on machine learning. This method can recommend more suitable exercises to students according to the category they belong to. Firstly, we use linear regression and EM algorithm to accurately model the students' mastery of each knowledge point. For each knowledge point, students are divided into several categories according to their mastery of the knowledge point and their average mastery of all knowledge points. For each knowledge point, according to the student history answer record, find out the exercise that can make each kind of student get bigger promotion respectively. For the students who need to recommend the exercises that contain the specified knowledge points, we first use the k-nearest neighbor algorithm to classify the students, and then recommend the exercises suitable for the students. It has been proved by experiments that this method can help students to achieve greater improvement in the same number of exercises.\",\"PeriodicalId\":170895,\"journal\":{\"name\":\"2021 International Conference on Advanced Learning Technologies (ICALT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Advanced Learning Technologies (ICALT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICALT52272.2021.00023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Advanced Learning Technologies (ICALT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICALT52272.2021.00023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

提出了一种基于机器学习的习题推荐方法。这种方法可以根据学生所属的类别为他们推荐更适合的练习。首先,我们使用线性回归和EM算法来准确地模拟学生对每个知识点的掌握情况。对于每个知识点,根据学生对知识点的掌握程度和对所有知识点的平均掌握程度将学生分成几类。对于每一个知识点,根据学生历史答题记录,分别找出能使各类学生得到更大提升的练习。对于需要推荐包含指定知识点的练习的学生,我们首先使用k近邻算法对学生进行分类,然后推荐适合该学生的练习。实验证明,这种方法可以帮助学生在相同数量的练习中取得更大的进步。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Exercise Recommendation Method Based on Machine Learning
This paper presents a method of exercises recommendation based on machine learning. This method can recommend more suitable exercises to students according to the category they belong to. Firstly, we use linear regression and EM algorithm to accurately model the students' mastery of each knowledge point. For each knowledge point, students are divided into several categories according to their mastery of the knowledge point and their average mastery of all knowledge points. For each knowledge point, according to the student history answer record, find out the exercise that can make each kind of student get bigger promotion respectively. For the students who need to recommend the exercises that contain the specified knowledge points, we first use the k-nearest neighbor algorithm to classify the students, and then recommend the exercises suitable for the students. It has been proved by experiments that this method can help students to achieve greater improvement in the same number of exercises.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Micro-Prompt: A Strategy for Designing Pedagogically Effective Assignment Free Micro-Lectures for Online Education Systems An Exploratory Study to Identify Learners' Programming Behavior Interactions Automatic and Intelligent Recommendations to Support Students’ Self-Regulation VEA: A Virtual Environment for Animal experimentation Teachers’ Information and Communication Technology (ICT) Assessment Tools: A Review
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1