基于K-Means聚类算法的学生GPA分类与预测

Raden Gunawan Santosa, Yuan Lukito, Antonius Rachmat Chrismanto
{"title":"基于K-Means聚类算法的学生GPA分类与预测","authors":"Raden Gunawan Santosa, Yuan Lukito, Antonius Rachmat Chrismanto","doi":"10.20473/JISEBI.7.1.1-10","DOIUrl":null,"url":null,"abstract":"Background: Student admission at universities aims to select the best candidates who will excel and finish their studies on time. There are many factors to be considered in student admission. To assist the process, an intelligent model is needed to spot the potentially high achieving students, as well as to identify potentially struggling students as early as possible. Objective: This research uses K-means clustering to predict students’ grade point average (GPA) based on students’ profile, such as high school status and location, university entrance test score and English language competence. Methods: Students’ data from class of 2008 to 2017 are used to create two clusters using K-means clustering algorithm. Two centroids from the clusters are used to classify all the data into two groups:  high GPA and low GPA. We use the data from class of 2018 as test data.  The performance of the prediction is measured using accuracy, precision and recall. Results: Based on the analysis, the K-means clustering method is 78.59% accurate among the merit-based-admission students and 94.627% among the regular-admission students. Conclusion: The prediction involving merit-based-admission students has lower predictive accuracy values than that of involving regular-admission students because the clustering model for the merit-based-admission data is K = 3, but for the prediction, the assumption is K = 2.","PeriodicalId":16185,"journal":{"name":"Journal of Information Systems Engineering and Business Intelligence","volume":"39 1","pages":"1-10"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Classification and Prediction of Students’ GPA Using K-Means Clustering Algorithm to Assist Student Admission Process\",\"authors\":\"Raden Gunawan Santosa, Yuan Lukito, Antonius Rachmat Chrismanto\",\"doi\":\"10.20473/JISEBI.7.1.1-10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Background: Student admission at universities aims to select the best candidates who will excel and finish their studies on time. There are many factors to be considered in student admission. To assist the process, an intelligent model is needed to spot the potentially high achieving students, as well as to identify potentially struggling students as early as possible. Objective: This research uses K-means clustering to predict students’ grade point average (GPA) based on students’ profile, such as high school status and location, university entrance test score and English language competence. Methods: Students’ data from class of 2008 to 2017 are used to create two clusters using K-means clustering algorithm. Two centroids from the clusters are used to classify all the data into two groups:  high GPA and low GPA. We use the data from class of 2018 as test data.  The performance of the prediction is measured using accuracy, precision and recall. Results: Based on the analysis, the K-means clustering method is 78.59% accurate among the merit-based-admission students and 94.627% among the regular-admission students. Conclusion: The prediction involving merit-based-admission students has lower predictive accuracy values than that of involving regular-admission students because the clustering model for the merit-based-admission data is K = 3, but for the prediction, the assumption is K = 2.\",\"PeriodicalId\":16185,\"journal\":{\"name\":\"Journal of Information Systems Engineering and Business Intelligence\",\"volume\":\"39 1\",\"pages\":\"1-10\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Systems Engineering and Business Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20473/JISEBI.7.1.1-10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Systems Engineering and Business Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20473/JISEBI.7.1.1-10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

背景:大学录取学生的目的是选择最优秀的候选人,他们将出类拔萃,按时完成学业。录取学生时要考虑很多因素。为了帮助这一过程,需要一个智能模型来发现潜在的高成就学生,以及尽早识别潜在的挣扎学生。目的:利用K-means聚类方法,基于学生的高中学籍、地理位置、高考成绩和英语语言能力等个人资料,预测学生的平均绩点(GPA)。方法:使用2008 - 2017级学生数据,采用K-means聚类算法建立两个聚类。使用聚类中的两个质心将所有数据分为两组:高GPA和低GPA。我们使用2018届毕业生的数据作为测试数据。预测的性能是用准确性、精密度和召回率来衡量的。结果:经分析,K-means聚类方法在择优录取学生中的准确率为78.59%,在普通录取学生中的准确率为94.627%。结论:由于择优录取数据的聚类模型为K = 3,而预测假设为K = 2,因此择优录取预测的预测精度值低于普通录取预测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Classification and Prediction of Students’ GPA Using K-Means Clustering Algorithm to Assist Student Admission Process
Background: Student admission at universities aims to select the best candidates who will excel and finish their studies on time. There are many factors to be considered in student admission. To assist the process, an intelligent model is needed to spot the potentially high achieving students, as well as to identify potentially struggling students as early as possible. Objective: This research uses K-means clustering to predict students’ grade point average (GPA) based on students’ profile, such as high school status and location, university entrance test score and English language competence. Methods: Students’ data from class of 2008 to 2017 are used to create two clusters using K-means clustering algorithm. Two centroids from the clusters are used to classify all the data into two groups:  high GPA and low GPA. We use the data from class of 2018 as test data.  The performance of the prediction is measured using accuracy, precision and recall. Results: Based on the analysis, the K-means clustering method is 78.59% accurate among the merit-based-admission students and 94.627% among the regular-admission students. Conclusion: The prediction involving merit-based-admission students has lower predictive accuracy values than that of involving regular-admission students because the clustering model for the merit-based-admission data is K = 3, but for the prediction, the assumption is K = 2.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.30
自引率
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学术官方微信