A Cumulative Increasing Kemelized Nearest-Neighbor Bagging Method for Early Course-Level Study Performance Prediction

Vo Thi Ngoc Chau, N. H. Phung
{"title":"A Cumulative Increasing Kemelized Nearest-Neighbor Bagging Method for Early Course-Level Study Performance Prediction","authors":"Vo Thi Ngoc Chau, N. H. Phung","doi":"10.1109/ICEAST52143.2021.9426259","DOIUrl":null,"url":null,"abstract":"Early course-level study performance prediction is a significant educational data mining task to forecast the success of each current student in a course using the historical data of the students in the previous same course. This task can be resolved by different machine learning approaches in various educational contexts. However, how easily and effectively a solution is deployed in practice is restricted by many factors. Two main factors that have not yet been discussed simultaneously are incremental mining and interpretability when the task is prolonged course after course. Therefore, in this paper, we propose a novel cumulative increasing kernelized nearest-neighbor bagging method for early course-level study performance prediction. Our method is a lazy learning one with an inherent incremental mining mechanism, defined as an ensemble method. Although it works in a feature space to handle a non-linearly separated data space, interpretability is enabled with instance-based learning and a confidence score of each prediction is further provided for practical applications. Experimental results on several public datasets confirm the effectiveness of our method as compared to other traditional prediction methods and well-known ensemble ones. Its better early predictions can help both students and lecturers make appropriate course changes for students’ ultimate success.","PeriodicalId":416531,"journal":{"name":"2021 7th International Conference on Engineering, Applied Sciences and Technology (ICEAST)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th International Conference on Engineering, Applied Sciences and Technology (ICEAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEAST52143.2021.9426259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Early course-level study performance prediction is a significant educational data mining task to forecast the success of each current student in a course using the historical data of the students in the previous same course. This task can be resolved by different machine learning approaches in various educational contexts. However, how easily and effectively a solution is deployed in practice is restricted by many factors. Two main factors that have not yet been discussed simultaneously are incremental mining and interpretability when the task is prolonged course after course. Therefore, in this paper, we propose a novel cumulative increasing kernelized nearest-neighbor bagging method for early course-level study performance prediction. Our method is a lazy learning one with an inherent incremental mining mechanism, defined as an ensemble method. Although it works in a feature space to handle a non-linearly separated data space, interpretability is enabled with instance-based learning and a confidence score of each prediction is further provided for practical applications. Experimental results on several public datasets confirm the effectiveness of our method as compared to other traditional prediction methods and well-known ensemble ones. Its better early predictions can help both students and lecturers make appropriate course changes for students’ ultimate success.
一种用于早期课程水平学习成绩预测的累积递增Kemelized最近邻套袋法
早期课程水平学习成绩预测是一项重要的教育数据挖掘任务,它利用上一门课程学生的历史数据来预测当前每个学生在该课程中的成功程度。这个任务可以在不同的教育环境中通过不同的机器学习方法来解决。然而,在实践中部署解决方案的容易程度和有效程度受到许多因素的限制。两个尚未同时讨论的主要因素是增量挖掘和当任务一门接一门地延长时的可解释性。因此,在本文中,我们提出了一种新的累积递增核化最近邻套袋方法,用于早期课程水平的学习成绩预测。我们的方法是一种具有固有增量挖掘机制的惰性学习方法,定义为集成方法。虽然它在特征空间中处理非线性分离的数据空间,但它通过基于实例的学习实现了可解释性,并进一步为实际应用提供了每个预测的置信度分数。在多个公开数据集上的实验结果验证了该方法与其他传统预测方法和已知集合预测方法的有效性。它更好的早期预测可以帮助学生和老师为学生的最终成功做出适当的课程调整。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信