Design and Development of an optimal algorithm to assign applicants to suitable teaching positions

Mumbi Chishimba, D. Kunda
{"title":"Design and Development of an optimal algorithm to assign applicants to suitable teaching positions","authors":"Mumbi Chishimba, D. Kunda","doi":"10.33260/ZICTJOURNAL.V2I2.59","DOIUrl":null,"url":null,"abstract":"Resource allocation has always been an area of interest and the era of computing. This is especially true in areas of computing such as machine learning which provides many solutions to the problem of resource allocation. The issue addressed in this paper is the issue of optimal allocation of applicants (teachers) to positions in schools where their area of specialization will be better applied. We develop an algorithm that is able to allocate applicants to schools based on the applicant qualifications and the school’s needs. We use the principles of resource allocation and machine learning in order to create an application to allocate applicants to schools where their qualifications are most suited. Methods used include classification techniques in machine learning, regression and   similarity comparison. For the identification is subjects an applicant in proficient in, various machine learning algorithms are tested to determine which machine learning algorithm will be best. The actual process of identifying which applicant qualifies for a school position is also tested against sequential assignment if applicants to schools. The results of this were that the algorithm based assignment of applicants to schools produced more accurate assignment of applicants to schools than the sequential assignment of applicants. The aim of this algorithm is to provide a solution to that automatically identifies the needs (subjects) of a school, determine which needs are to have a higher priority, identify the qualifications of the applicants and assign the applicants to the school according to the school’s needs and the applicant’s qualifications.","PeriodicalId":206279,"journal":{"name":"Zambia ICT Journal","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Zambia ICT Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33260/ZICTJOURNAL.V2I2.59","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Resource allocation has always been an area of interest and the era of computing. This is especially true in areas of computing such as machine learning which provides many solutions to the problem of resource allocation. The issue addressed in this paper is the issue of optimal allocation of applicants (teachers) to positions in schools where their area of specialization will be better applied. We develop an algorithm that is able to allocate applicants to schools based on the applicant qualifications and the school’s needs. We use the principles of resource allocation and machine learning in order to create an application to allocate applicants to schools where their qualifications are most suited. Methods used include classification techniques in machine learning, regression and   similarity comparison. For the identification is subjects an applicant in proficient in, various machine learning algorithms are tested to determine which machine learning algorithm will be best. The actual process of identifying which applicant qualifies for a school position is also tested against sequential assignment if applicants to schools. The results of this were that the algorithm based assignment of applicants to schools produced more accurate assignment of applicants to schools than the sequential assignment of applicants. The aim of this algorithm is to provide a solution to that automatically identifies the needs (subjects) of a school, determine which needs are to have a higher priority, identify the qualifications of the applicants and assign the applicants to the school according to the school’s needs and the applicant’s qualifications.
设计并开发一种最优算法,将申请人分配到合适的教学岗位
资源分配一直是人们感兴趣的领域和计算时代。在计算领域尤其如此,比如机器学习,它为资源分配问题提供了许多解决方案。本文解决的问题是申请人(教师)的最佳分配问题,他们的专业领域将更好地应用到学校的职位。我们开发了一种算法,能够根据申请人的资格和学校的需求将申请人分配到学校。我们使用资源分配和机器学习的原则来创建一个应用程序,将申请人分配到最适合他们资格的学校。使用的方法包括机器学习中的分类技术、回归和相似性比较。为了识别申请人精通的科目,我们测试了各种机器学习算法,以确定哪种机器学习算法是最好的。确定哪位申请人有资格申请学校职位的实际过程也将与申请人到学校的顺序分配进行对比。其结果是,基于算法的申请人分配学校比顺序分配申请人更准确地分配申请人到学校。该算法的目的是提供一种解决方案,自动识别学校的需求(科目),确定哪些需求具有更高的优先级,识别申请人的资格,并根据学校的需求和申请人的资格将申请人分配到学校。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信