利用K-近邻算法对高中奖学金获得者进行分类

Ica Dwi, Gusmelia Testiana, Imamulhakim Syahid Putra
{"title":"利用K-近邻算法对高中奖学金获得者进行分类","authors":"Ica Dwi, Gusmelia Testiana, Imamulhakim Syahid Putra","doi":"10.14421/ijid.2022.3804","DOIUrl":null,"url":null,"abstract":" \nYBM PLN UIWS2JB provides scholarships for high school students who cannot afford school tuition due to poverty or other economic conditions. Since the target is specific, the foundation must carefully select the recipients to ensure the scholarship is granted to those who deserve it. The predetermined criteria combined with the limited quota available become a difficulty in itself as a large number of applications are coming in. Data mining with a classification method using the K-Nearest Neighbor algorithm is believed to be one of the alternative solutions to solve this problem. This study aims to examine how this method could help in the selection process to determine who is eligible to receive the scholarship, and it also aims to evaluate the algorithm's performance with the optimal K value. The findings of this research showed that the classification method using K-Nearest Neighbor is the potential to be applied in a case such as this. The results found an accuracy of 91% in the selection process and are included in the Excellent Classification category. The optimal K value obtained is K = 5.","PeriodicalId":33558,"journal":{"name":"IJID International Journal on Informatics for Development","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Classifying High School Scholarship Recipients Using the K-Nearest Neighbor Algorithm\",\"authors\":\"Ica Dwi, Gusmelia Testiana, Imamulhakim Syahid Putra\",\"doi\":\"10.14421/ijid.2022.3804\",\"DOIUrl\":null,\"url\":null,\"abstract\":\" \\nYBM PLN UIWS2JB provides scholarships for high school students who cannot afford school tuition due to poverty or other economic conditions. Since the target is specific, the foundation must carefully select the recipients to ensure the scholarship is granted to those who deserve it. The predetermined criteria combined with the limited quota available become a difficulty in itself as a large number of applications are coming in. Data mining with a classification method using the K-Nearest Neighbor algorithm is believed to be one of the alternative solutions to solve this problem. This study aims to examine how this method could help in the selection process to determine who is eligible to receive the scholarship, and it also aims to evaluate the algorithm's performance with the optimal K value. The findings of this research showed that the classification method using K-Nearest Neighbor is the potential to be applied in a case such as this. The results found an accuracy of 91% in the selection process and are included in the Excellent Classification category. The optimal K value obtained is K = 5.\",\"PeriodicalId\":33558,\"journal\":{\"name\":\"IJID International Journal on Informatics for Development\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IJID International Journal on Informatics for Development\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14421/ijid.2022.3804\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IJID International Journal on Informatics for Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14421/ijid.2022.3804","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

YBM PLN UIWS2JB为因贫困或其他经济条件而无法负担学费的高中生提供奖学金。由于目标是具体的,基金会必须仔细选择受助人,以确保奖学金授予那些值得获得奖学金的人。预定的标准加上有限的可用配额本身就成为一个困难,因为大量的申请正在到来。使用k近邻算法的数据挖掘分类方法被认为是解决这一问题的备选方案之一。本研究旨在研究该方法如何在选择过程中帮助确定谁有资格获得奖学金,并以最优K值评估算法的性能。本研究的结果表明,使用k近邻的分类方法在此类情况下具有应用的潜力。结果发现,在选择过程中的准确率为91%,并被列入优秀分类类别。得到的最优K值为K = 5。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Classifying High School Scholarship Recipients Using the K-Nearest Neighbor Algorithm
  YBM PLN UIWS2JB provides scholarships for high school students who cannot afford school tuition due to poverty or other economic conditions. Since the target is specific, the foundation must carefully select the recipients to ensure the scholarship is granted to those who deserve it. The predetermined criteria combined with the limited quota available become a difficulty in itself as a large number of applications are coming in. Data mining with a classification method using the K-Nearest Neighbor algorithm is believed to be one of the alternative solutions to solve this problem. This study aims to examine how this method could help in the selection process to determine who is eligible to receive the scholarship, and it also aims to evaluate the algorithm's performance with the optimal K value. The findings of this research showed that the classification method using K-Nearest Neighbor is the potential to be applied in a case such as this. The results found an accuracy of 91% in the selection process and are included in the Excellent Classification category. The optimal K value obtained is K = 5.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
6
审稿时长
8 weeks
×
引用
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学术官方微信