k - medidoids和K-means算法在基于学习成绩分割学生中的适用性

Usha Badhera, Apoorva Verma, P. Nahar
{"title":"k - medidoids和K-means算法在基于学习成绩分割学生中的适用性","authors":"Usha Badhera, Apoorva Verma, P. Nahar","doi":"10.1080/09720510.2022.2130566","DOIUrl":null,"url":null,"abstract":"Abstract In this paper literature was surveyed to find popular clustering techniques used by researchers in recent times to predict academic performance. We obtained a trend that the K-means algorithm is particularly popular among researchers because of its simplicity and scalability, and in other studies K-medoids algorithm was selected as it is less affected by outliers. On the basis of these observations these two clustering algorithms were implemented in Python, on student dataset of undergraduate students from a higher education institute. Two different clusters were obtained which segment students based on their academic performances in the previous two exams. The clusters obtained by have high accuracy score and K-medoids cluster centroids have taken exact values of marks obtained by students whereas K-means centroid value is a round off. The K-means clustering is also affected by the presence of outliers in the student dataset.","PeriodicalId":270059,"journal":{"name":"Journal of Statistics and Management Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Applicability of K-medoids and K-means algorithms for segmenting students based on their scholastic performance\",\"authors\":\"Usha Badhera, Apoorva Verma, P. Nahar\",\"doi\":\"10.1080/09720510.2022.2130566\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this paper literature was surveyed to find popular clustering techniques used by researchers in recent times to predict academic performance. We obtained a trend that the K-means algorithm is particularly popular among researchers because of its simplicity and scalability, and in other studies K-medoids algorithm was selected as it is less affected by outliers. On the basis of these observations these two clustering algorithms were implemented in Python, on student dataset of undergraduate students from a higher education institute. Two different clusters were obtained which segment students based on their academic performances in the previous two exams. The clusters obtained by have high accuracy score and K-medoids cluster centroids have taken exact values of marks obtained by students whereas K-means centroid value is a round off. The K-means clustering is also affected by the presence of outliers in the student dataset.\",\"PeriodicalId\":270059,\"journal\":{\"name\":\"Journal of Statistics and Management Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Statistics and Management Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/09720510.2022.2130566\",\"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 Statistics and Management Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/09720510.2022.2130566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

摘要本文通过对相关文献的梳理,发现近年来研究人员常用的聚类技术来预测学生的学习成绩。我们发现K-means算法因其简单和可扩展性而受到研究人员的特别欢迎,而在其他研究中选择k - mediids算法是因为它受离群值的影响较小。在这些观察的基础上,这两种聚类算法在Python中实现,来自高等教育机构的本科生的学生数据集。根据学生在前两次考试中的学习成绩,获得了两个不同的分组。所得到的聚类具有较高的准确率分数,k - median聚类质心取了学生得到的分数的准确值,而K-means质心值是一个四舍五入。K-means聚类也受到学生数据集中异常值存在的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Applicability of K-medoids and K-means algorithms for segmenting students based on their scholastic performance
Abstract In this paper literature was surveyed to find popular clustering techniques used by researchers in recent times to predict academic performance. We obtained a trend that the K-means algorithm is particularly popular among researchers because of its simplicity and scalability, and in other studies K-medoids algorithm was selected as it is less affected by outliers. On the basis of these observations these two clustering algorithms were implemented in Python, on student dataset of undergraduate students from a higher education institute. Two different clusters were obtained which segment students based on their academic performances in the previous two exams. The clusters obtained by have high accuracy score and K-medoids cluster centroids have taken exact values of marks obtained by students whereas K-means centroid value is a round off. The K-means clustering is also affected by the presence of outliers in the student dataset.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Rainfall and outlier rain prediction with ARIMA and ANN models Industry-academia collaboration in higher education institutes: With special emphasis on B-schools Acclimatization of spirituality in leadership and management Time series forecasting of stock price of AirAsia Berhad using ARIMA model during COVID- 19 Optimization of multi-echelon reverse supply chain network using genetic algorithm
×
引用
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