Student Academic Performance Prediction on Problem Based Learning Using Support Vector Machine and K-Nearest Neighbor

Badieah Assegaf
{"title":"Student Academic Performance Prediction on Problem Based Learning Using Support Vector Machine and K-Nearest Neighbor","authors":"Badieah Assegaf","doi":"10.12928/jti.v5i1.22-28","DOIUrl":null,"url":null,"abstract":"Academic evaluation is an important process to know how well the learning process was conducted and also one of the decisive factors that can determine the quality of the higher education institution. Though it usually curative, the preventive effort is needed by predicting the performance of the student before the semester begin. This effort aimed to reduce the failure rate of the students in certain subjects and make it easier for the PBL tutor to create appropiate learning strategies before the tutorial class begin. The purpose of this work is to find the best data mining technique to predict student academic performance on PBL system between two data mining classification algorithms. This work applied and compared the performance of the classifier models built from Support Vector Machine (SVM) and K-Nearest Neighbor (KNN). After preprocessed the dataset, the classifier models were developed and validated. The result shows that both algorithms were giving good accuracy by 97% and 95,52% respectively though SVM showing the best performance compared to KNN in F-Measure with 80%. The further deployment is needed to integrate the model with academic information system, so that academic evaluation can be easily done.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Telematics and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12928/jti.v5i1.22-28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Academic evaluation is an important process to know how well the learning process was conducted and also one of the decisive factors that can determine the quality of the higher education institution. Though it usually curative, the preventive effort is needed by predicting the performance of the student before the semester begin. This effort aimed to reduce the failure rate of the students in certain subjects and make it easier for the PBL tutor to create appropiate learning strategies before the tutorial class begin. The purpose of this work is to find the best data mining technique to predict student academic performance on PBL system between two data mining classification algorithms. This work applied and compared the performance of the classifier models built from Support Vector Machine (SVM) and K-Nearest Neighbor (KNN). After preprocessed the dataset, the classifier models were developed and validated. The result shows that both algorithms were giving good accuracy by 97% and 95,52% respectively though SVM showing the best performance compared to KNN in F-Measure with 80%. The further deployment is needed to integrate the model with academic information system, so that academic evaluation can be easily done.
基于支持向量机和k近邻的问题学习学生学习成绩预测
学术评价是了解学习过程进行情况的重要过程,也是决定高等教育质量的决定性因素之一。虽然它通常是治疗性的,但需要在学期开始前预测学生的表现来预防。这一努力旨在降低学生在某些科目上的不及格率,并使PBL导师在辅导课开始前更容易制定适当的学习策略。本研究的目的是在两种数据挖掘分类算法之间寻找最佳的数据挖掘技术来预测PBL系统上学生的学习成绩。本研究应用并比较了支持向量机(SVM)和k -最近邻(KNN)建立的分类器模型的性能。对数据集进行预处理后,建立分类器模型并进行验证。结果表明,两种算法的准确率分别为97%和95.52%,其中SVM在F-Measure中表现出最好的性能,达到80%。需要进一步的部署,将该模型与学术信息系统相结合,从而方便地进行学术评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信