Student graduation time prediction using intelligent K-Medoids Algorithm

Leonardo Cahaya, Lely Hiryanto, Teny Handhayani
{"title":"Student graduation time prediction using intelligent K-Medoids Algorithm","authors":"Leonardo Cahaya, Lely Hiryanto, Teny Handhayani","doi":"10.1109/ICSITECH.2017.8257122","DOIUrl":null,"url":null,"abstract":"We proposed unsupervised learning, the Intelligent K-Medoids Algorithm to predict, the length of a study time of universitys students. This algorithm automatically clusters all students based on their 25 weighted scores from 25 different subject as the features. We tested the implementation of the algorithm using 240 students scores. These 240 students have graduated and their graduation time is considered for labeling the cluster. The result is 7 clusters with silhouette value of 0.2416. Each cluster is labeled according to the range of student graduation time. The range in each cluster exists due to the existence of students whose majority of scores are similar, but their graduation times are different. Academic leaving or extending the completion of thesis are the other factors contributing the range graduation time in each cluster. The prediction by k-folding 240 data to 5 subsets results average prediction accuracy of 99.58.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 3rd International Conference on Science in Information Technology (ICSITech)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSITECH.2017.8257122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

We proposed unsupervised learning, the Intelligent K-Medoids Algorithm to predict, the length of a study time of universitys students. This algorithm automatically clusters all students based on their 25 weighted scores from 25 different subject as the features. We tested the implementation of the algorithm using 240 students scores. These 240 students have graduated and their graduation time is considered for labeling the cluster. The result is 7 clusters with silhouette value of 0.2416. Each cluster is labeled according to the range of student graduation time. The range in each cluster exists due to the existence of students whose majority of scores are similar, but their graduation times are different. Academic leaving or extending the completion of thesis are the other factors contributing the range graduation time in each cluster. The prediction by k-folding 240 data to 5 subsets results average prediction accuracy of 99.58.
基于智能k - mediids算法的学生毕业时间预测
我们提出了无监督学习,智能k - mediids算法来预测大学生学习时间的长短。该算法根据25个不同学科的25个加权分数自动聚类所有学生作为特征。我们使用240名学生的分数测试了算法的实现。这240名学生已经毕业,他们的毕业时间被用来标记聚类。结果为7个聚类,剪影值为0.2416。每个聚类根据学生毕业时间的范围进行标记。每个聚类的范围之所以存在,是因为存在着大多数分数相似,但毕业时间不同的学生。离校或延长毕业时间是影响各集群毕业时间范围的其他因素。将240个数据k折叠到5个子集进行预测,平均预测准确率为99.58。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信