Tailored Military Recruitment through Machine Learning Algorithms

R. Bryce, R. Ueno, C. McDonald, D. Calitoiu
{"title":"Tailored Military Recruitment through Machine Learning Algorithms","authors":"R. Bryce, R. Ueno, C. McDonald, D. Calitoiu","doi":"10.5220/0010506500870092","DOIUrl":null,"url":null,"abstract":"Identifying postal codes with the highest recruiting potential corresponding to the desired profile for a military occupation can be achieved by using the demographics of the population living in that postal code and the location of both the successful and unsuccessful applicants. Selecting N individuals with the highest probability to be enrolled from a population living in untapped postal codes can be done by ranking the postal codes using a machine learning predictive model. Three such models are presented in this paper: a logistic regression, a multi-layer perceptron and a deep neural network. The key contribution of this paper is an algorithm that combines these models, benefiting from the performance of each of them, producing a desired selection of postal codes. This selection can be converted into N prospects living in these areas. A dataset consisting of the applications to the Canadian Armed Forces (CAF) is used to illustrate the methodology proposed.","PeriodicalId":88612,"journal":{"name":"News. Phi Delta Epsilon","volume":"72 1","pages":"87-92"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"News. Phi Delta Epsilon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0010506500870092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Identifying postal codes with the highest recruiting potential corresponding to the desired profile for a military occupation can be achieved by using the demographics of the population living in that postal code and the location of both the successful and unsuccessful applicants. Selecting N individuals with the highest probability to be enrolled from a population living in untapped postal codes can be done by ranking the postal codes using a machine learning predictive model. Three such models are presented in this paper: a logistic regression, a multi-layer perceptron and a deep neural network. The key contribution of this paper is an algorithm that combines these models, benefiting from the performance of each of them, producing a desired selection of postal codes. This selection can be converted into N prospects living in these areas. A dataset consisting of the applications to the Canadian Armed Forces (CAF) is used to illustrate the methodology proposed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过机器学习算法定制军队招募
通过使用居住在该邮政编码的人口的人口统计数据以及成功和不成功的申请人的所在地,可以确定与军事占领所需的概况相对应的具有最高招募潜力的邮政编码。通过使用机器学习预测模型对邮政编码进行排序,可以从居住在未开发邮政编码的人口中选择概率最高的N个人。本文提出了三种模型:逻辑回归模型、多层感知器模型和深度神经网络模型。本文的关键贡献是一种结合这些模型的算法,从每个模型的性能中受益,产生期望的邮政编码选择。这一选择可转化为生活在这些地区的N个远景区。一个由加拿大武装部队(CAF)应用程序组成的数据集用于说明所提出的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
GAN-Based LiDAR Intensity Simulation Improving Primate Sounds Classification using Binary Presorting for Deep Learning Towards exploring adversarial learning for anomaly detection in complex driving scenes A Study of Neural Collapse for Text Classification Using Artificial Intelligence to Reduce the Risk of Transfusion Hemolytic Reactions
×
引用
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