Clustering Courses Based On Student Grades Using K-Means Algorithm With Elbow Method For Centroid Determination

Muhammad Al Ghifari, Wahyuningdiah Trisari Harsanti Putri
{"title":"Clustering Courses Based On Student Grades Using K-Means Algorithm With Elbow Method For Centroid Determination","authors":"Muhammad Al Ghifari, Wahyuningdiah Trisari Harsanti Putri","doi":"10.25139/inform.v8i1.4519","DOIUrl":null,"url":null,"abstract":"Students who have taken courses will receive grades from a performance index with a weight of 0 to 4. The amount of historical student data, particularly on course grades, has the potential to discover new insights. Still, course grades are closed data and are only for academic and management purposes. The research aims to a grouping of courses with high average grades. In this research, the clustering of courses using the k-means clustering algorithm using the elbow method to determine the centroid. Based on the Sum of Squares calculation, the optimal number of clusters with k=2 was obtained. The clustering results produced cluster 1 with a centroid value of 2.686 and 15 members and cluster 2 with a centroid value of 3.245 and 40 members. It can be concluded from this research that the members of cluster 2 are a group of courses with high average grades. \n ","PeriodicalId":52760,"journal":{"name":"Inform Jurnal Ilmiah Bidang Teknologi Informasi dan Komunikasi","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Inform Jurnal Ilmiah Bidang Teknologi Informasi dan Komunikasi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25139/inform.v8i1.4519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Students who have taken courses will receive grades from a performance index with a weight of 0 to 4. The amount of historical student data, particularly on course grades, has the potential to discover new insights. Still, course grades are closed data and are only for academic and management purposes. The research aims to a grouping of courses with high average grades. In this research, the clustering of courses using the k-means clustering algorithm using the elbow method to determine the centroid. Based on the Sum of Squares calculation, the optimal number of clusters with k=2 was obtained. The clustering results produced cluster 1 with a centroid value of 2.686 and 15 members and cluster 2 with a centroid value of 3.245 and 40 members. It can be concluded from this research that the members of cluster 2 are a group of courses with high average grades.  
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于学生成绩的k -均值聚类课程与肘形法聚类
参加课程的学生将从一个绩效指数中获得分数,权重为0到4。大量的历史学生数据,特别是课程成绩,有可能发现新的见解。然而,课程成绩是封闭数据,仅用于学术和管理目的。这项研究的目标是一组平均成绩高的课程。在本研究中,对课程的聚类采用k-means聚类算法,采用肘形法确定质心。通过平方和计算,得到k=2的最优簇数。聚类结果得到的聚类1的质心值为2.686,15个成员;聚类2的质心值为3.245,40个成员。通过本研究可以得出,集群2的成员是一组平均成绩较高的课程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
31
审稿时长
10 weeks
期刊最新文献
Blended Learning Vocationalogy Entrepreneurship Program: Analysis of Human-Computer Interaction Based on Technology Acceptance Model (TAM) Sentiment Analysis for IMDb Movie Review Using Support Vector Machine (SVM) Method Estimation of Brake Pad Wear Using Fuzzy Logic in Real Time Website Analysis and Design Using Iconix Process Method: Case Study: Kedai Lengghian Classification of Pistachio Nut Using Convolutional Neural Network
×
引用
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