School Zoning System for Student Admission using Constrained K-Means Algorithms

Andi Akram Nur Risal, Z. Zainuddin, M. Niswar
{"title":"School Zoning System for Student Admission using Constrained K-Means Algorithms","authors":"Andi Akram Nur Risal, Z. Zainuddin, M. Niswar","doi":"10.1109/COMNETSAT56033.2022.9994366","DOIUrl":null,"url":null,"abstract":"The issuance of the Regulation Minister of Education and Culture number 51 of 2018 regulates new student admission by implementing a zoning system to achieve equal distribution of education quality in every school, especially at the high school level in Makassar city. This study aims to cluster the school zoning area based on the closest distance between the student's domicile and the school location. The dataset used is 22 school locations and 2248 student location data. In this paper, the method used is constrained k-means to cluster the prospective new students to each school. The constrained k-means method works based on the value of K as the closest cluster center to the value of N (cluster members) with a linear programming algorithm (LPA) approach so that each cluster has a balanced N member. The results of this study can overcome the unbalanced data distribution problem with an average cluster member value of 103 and the absence of empty clusters in each school/centroid. Thus, the system can be implemented in the new student admissions process as a reference in determining the optimal and accurate school zoning area based on the cluster center.","PeriodicalId":221444,"journal":{"name":"2022 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMNETSAT56033.2022.9994366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The issuance of the Regulation Minister of Education and Culture number 51 of 2018 regulates new student admission by implementing a zoning system to achieve equal distribution of education quality in every school, especially at the high school level in Makassar city. This study aims to cluster the school zoning area based on the closest distance between the student's domicile and the school location. The dataset used is 22 school locations and 2248 student location data. In this paper, the method used is constrained k-means to cluster the prospective new students to each school. The constrained k-means method works based on the value of K as the closest cluster center to the value of N (cluster members) with a linear programming algorithm (LPA) approach so that each cluster has a balanced N member. The results of this study can overcome the unbalanced data distribution problem with an average cluster member value of 103 and the absence of empty clusters in each school/centroid. Thus, the system can be implemented in the new student admissions process as a reference in determining the optimal and accurate school zoning area based on the cluster center.
基于约束k -均值算法的学校招生分区系统
2018年教育和文化法规部长第51号的发布通过实施分区制度来规范新生入学,以实现每所学校教育质量的平等分配,特别是在望加锡市的高中阶段。本研究旨在根据学生住所与学校所在地之间的最近距离来聚集学校分区区域。使用的数据集是22所学校和2248名学生的位置数据。在本文中,使用的方法是约束k-means将未来的新生聚类到每个学校。约束K -means方法采用线性规划算法(LPA),以K作为最接近N(集群成员)值的集群中心,使每个集群具有均衡的N个成员。本文的研究结果克服了平均聚类成员值为103的数据分布不平衡以及每个学校/质心中没有空聚类的问题。因此,该系统可以在新生招生过程中实施,作为基于集群中心确定最优和准确的学校分区区域的参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信