Balanced clustering for student admission school zoning by parameter tuning of constrained k-means

Zahir Zainuddin, Andi Alviadi Nur Risal
{"title":"Balanced clustering for student admission school zoning by parameter tuning of constrained k-means","authors":"Zahir Zainuddin, Andi Alviadi Nur Risal","doi":"10.11591/ijai.v13.i2.pp2301-2313","DOIUrl":null,"url":null,"abstract":"The Indonesian government issued a regulation through the Ministry of Education and Culture, number 51 of 2018, which contains zoning rules to improve the quality of education in school educational institutions. This research aims to compare the performance of the k-means algorithm with the constrained k-means algorithm to model the zoning of each school area based on the shortest distance parameter between the school location and the domicile of prospective students. The study used data from 2248 prospective students and 22 public school locations. The results of testing the k-means algorithm in grouping showed the formation of non-circular patterns in the cluster membership with different numbers of centroid cluster members. In contrast, testing the constrained k-means algorithm showed balanced outcomes in cluster membership with a membership value of 103 for each school as the cluster center. The research findings state that the developed constrained k-means algorithm solves the problem of unbalanced data clustering and overlapping issues in the process of new student admissions. In other words, the constrained k-means algorithm can be a reference for the government in making decisions on new student admissions","PeriodicalId":507934,"journal":{"name":"IAES International Journal of Artificial Intelligence (IJ-AI)","volume":"1 8","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IAES International Journal of Artificial Intelligence (IJ-AI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11591/ijai.v13.i2.pp2301-2313","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Indonesian government issued a regulation through the Ministry of Education and Culture, number 51 of 2018, which contains zoning rules to improve the quality of education in school educational institutions. This research aims to compare the performance of the k-means algorithm with the constrained k-means algorithm to model the zoning of each school area based on the shortest distance parameter between the school location and the domicile of prospective students. The study used data from 2248 prospective students and 22 public school locations. The results of testing the k-means algorithm in grouping showed the formation of non-circular patterns in the cluster membership with different numbers of centroid cluster members. In contrast, testing the constrained k-means algorithm showed balanced outcomes in cluster membership with a membership value of 103 for each school as the cluster center. The research findings state that the developed constrained k-means algorithm solves the problem of unbalanced data clustering and overlapping issues in the process of new student admissions. In other words, the constrained k-means algorithm can be a reference for the government in making decisions on new student admissions
通过调整受约束 k-means 的参数实现招生学校分区的均衡聚类
印度尼西亚政府通过教育和文化部发布了 2018 年第 51 号法规,其中包含分区规则,以提高学校教育机构的教育质量。本研究旨在根据学校所在地与准学生户籍地之间的最短距离参数,比较 k-means 算法与约束 k-means 算法在模拟各学校区域分区方面的性能。研究使用了 2248 名准学生和 22 所公立学校所在地的数据。k-means 算法的分组测试结果表明,在不同中心点聚类成员数量的情况下,聚类成员资格形成了非圆形模式。与此形成对比的是,受限 k-means 算法的测试结果显示,以每所学校为聚类中心的成员值为 103,聚类成员组成均衡。研究结果表明,所开发的受约束 k-means 算法解决了新生录取过程中数据聚类不平衡和重叠的问题。换句话说,受约束 k-means 算法可为政府在新生录取决策时提供参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信