KIP-K学生特征聚类的K-Means算法实现

Fitri Nuraeni, D. Kurniadi, Gisna Fauzian Dermawan
{"title":"KIP-K学生特征聚类的K-Means算法实现","authors":"Fitri Nuraeni, D. Kurniadi, Gisna Fauzian Dermawan","doi":"10.1109/ICCoSITE57641.2023.10127852","DOIUrl":null,"url":null,"abstract":"The limited quota of recipients of the Kartu Indonesia Pintar Kuliah (KIP-K) causes the host universities to select applicants to get students who are eligible to receive KIP-K based on academic achievement, non-academic achievements, and family economic conditions. However, after the lectures started, some students who received KIP-K lacked discipline in undergoing lecture procedures and experienced a decrease in their achievement index (IP). Therefore, it is necessary to explore knowledge about the characteristics of KIP-K recipient students by conducting clustering modeling. So, in this study, clustering modeling was carried out on student data receiving KIP-K at a university by applying the Cross-Industry Standard Process for Data Mining (CRIPS-DM) method and the k-means clustering algorithm. This study chooses a clustering model with a value of k=2, which has the smallest Davies Bouldine index (DBI) value of 0.35. This clustering resulted in 2 clusters where student characteristics showed significant differences in the attributes of the distance from home to the campus location and relatively minor fluctuations in IP from the first semester to the fourth semester. From mapping the characteristics of KIP-K recipient students, knowledge can be used as material for higher education decisions in selecting KIP-K registrants to minimize the future academic problems of KIP-K recipient students.","PeriodicalId":256184,"journal":{"name":"2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Implementation of the K-Means Algorithm for Clustering the Characteristics of Students Receiving Kartu Indonesia Pintar Kuliah (KIP-K)\",\"authors\":\"Fitri Nuraeni, D. Kurniadi, Gisna Fauzian Dermawan\",\"doi\":\"10.1109/ICCoSITE57641.2023.10127852\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The limited quota of recipients of the Kartu Indonesia Pintar Kuliah (KIP-K) causes the host universities to select applicants to get students who are eligible to receive KIP-K based on academic achievement, non-academic achievements, and family economic conditions. However, after the lectures started, some students who received KIP-K lacked discipline in undergoing lecture procedures and experienced a decrease in their achievement index (IP). Therefore, it is necessary to explore knowledge about the characteristics of KIP-K recipient students by conducting clustering modeling. So, in this study, clustering modeling was carried out on student data receiving KIP-K at a university by applying the Cross-Industry Standard Process for Data Mining (CRIPS-DM) method and the k-means clustering algorithm. This study chooses a clustering model with a value of k=2, which has the smallest Davies Bouldine index (DBI) value of 0.35. This clustering resulted in 2 clusters where student characteristics showed significant differences in the attributes of the distance from home to the campus location and relatively minor fluctuations in IP from the first semester to the fourth semester. From mapping the characteristics of KIP-K recipient students, knowledge can be used as material for higher education decisions in selecting KIP-K registrants to minimize the future academic problems of KIP-K recipient students.\",\"PeriodicalId\":256184,\"journal\":{\"name\":\"2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCoSITE57641.2023.10127852\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCoSITE57641.2023.10127852","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

Kartu Indonesia Pintar Kuliah (KIP-K)的有限名额导致主办大学根据学术成就、非学术成就和家庭经济条件选择有资格获得KIP-K的申请人。但是,接受KIP-K的部分学生在讲课过程中缺乏纪律,成绩指数(IP)有所下降。因此,有必要通过聚类建模来探索KIP-K受援生的特征知识。因此,本研究采用跨行业数据挖掘标准流程(crics - dm)方法和k-means聚类算法,对某高校接受KIP-K的学生数据进行聚类建模。本研究选择k=2的聚类模型,其Davies Bouldine指数(DBI)值最小,为0.35。通过聚类可以得到2个聚类,在第一学期到第四学期,学生特征在离家到校园的距离属性上存在显著差异,IP波动相对较小。通过绘制KIP-K接收学生的特征,知识可以作为选择KIP-K注册者的高等教育决策的材料,以尽量减少KIP-K接收学生未来的学业问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Implementation of the K-Means Algorithm for Clustering the Characteristics of Students Receiving Kartu Indonesia Pintar Kuliah (KIP-K)
The limited quota of recipients of the Kartu Indonesia Pintar Kuliah (KIP-K) causes the host universities to select applicants to get students who are eligible to receive KIP-K based on academic achievement, non-academic achievements, and family economic conditions. However, after the lectures started, some students who received KIP-K lacked discipline in undergoing lecture procedures and experienced a decrease in their achievement index (IP). Therefore, it is necessary to explore knowledge about the characteristics of KIP-K recipient students by conducting clustering modeling. So, in this study, clustering modeling was carried out on student data receiving KIP-K at a university by applying the Cross-Industry Standard Process for Data Mining (CRIPS-DM) method and the k-means clustering algorithm. This study chooses a clustering model with a value of k=2, which has the smallest Davies Bouldine index (DBI) value of 0.35. This clustering resulted in 2 clusters where student characteristics showed significant differences in the attributes of the distance from home to the campus location and relatively minor fluctuations in IP from the first semester to the fourth semester. From mapping the characteristics of KIP-K recipient students, knowledge can be used as material for higher education decisions in selecting KIP-K registrants to minimize the future academic problems of KIP-K recipient students.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Customer Relationship Management, Customer Retention, and the Mediating Role of Customer Satisfaction on a Healthcare Mobile Applications Revalidating the Encoder-Decoder Depths and Activation Function to Find Optimum Vanilla Transformer Model Goertzel Algorithm Design on Field Programmable Gate Arrays For Implementing Electric Power Measurement Instagram vs TikTok: Which Engage Best for Consumer Brand Engagement for Social Commerce and Purchase Intention? Air Pollution Prediction using Random Forest Classifier: A Case Study of DKI Jakarta
×
引用
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