Identification Of Online Recruitment Fraud (ORF) Through Predictive Models

Riktesh Srivastava
{"title":"Identification Of Online Recruitment Fraud (ORF) Through Predictive Models","authors":"Riktesh Srivastava","doi":"10.54878/epv1hr57","DOIUrl":null,"url":null,"abstract":"Job postings online have become popular these days due to connecting to job seekers around the world. There are also instances where the fraudulent employer posts a job online and expects people to apply to these postings. These fraudulent employers impend job seekers' privacy, spawns fake job offers, and wanes. We perceived that most of the Online Recruitment Fraud (ORF) has matching features. Though the user cannot categorize them, we propose using various predictive models like Support Vector Machine (SVM), Artificial Neural Network (ANN), Random Forest, Naïve Bayes, or Logistics Regression to detect them effortlessly. Dataset with 17780 job postings was downloaded from Kaggle to identify which proposed model best predicts the fraudulent job posting. The dataset includes 14 features to determine whether online job posting is fraudulent or non-fraudulent. 70% of these job postings train the model, and the remaining 30% test the model's efficiency. The outcomes of each model are predicted using four evaluation metrics – Classification Accuracy (CA), Precision, Recall and F-1 score. The research found its suitability from two sides: the websites can identify fake jobs before being published, and job seekers are sheltered from fraudulent job postings.","PeriodicalId":491475,"journal":{"name":"Emirati Journal of Business Economics & Social Studies","volume":"41 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Emirati Journal of Business Economics & Social Studies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.54878/epv1hr57","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Job postings online have become popular these days due to connecting to job seekers around the world. There are also instances where the fraudulent employer posts a job online and expects people to apply to these postings. These fraudulent employers impend job seekers' privacy, spawns fake job offers, and wanes. We perceived that most of the Online Recruitment Fraud (ORF) has matching features. Though the user cannot categorize them, we propose using various predictive models like Support Vector Machine (SVM), Artificial Neural Network (ANN), Random Forest, Naïve Bayes, or Logistics Regression to detect them effortlessly. Dataset with 17780 job postings was downloaded from Kaggle to identify which proposed model best predicts the fraudulent job posting. The dataset includes 14 features to determine whether online job posting is fraudulent or non-fraudulent. 70% of these job postings train the model, and the remaining 30% test the model's efficiency. The outcomes of each model are predicted using four evaluation metrics – Classification Accuracy (CA), Precision, Recall and F-1 score. The research found its suitability from two sides: the websites can identify fake jobs before being published, and job seekers are sheltered from fraudulent job postings.
基于预测模型的在线招聘欺诈识别
由于与世界各地的求职者有联系,网上招聘最近变得很流行。还有一些情况是,欺诈性雇主在网上发布了一份工作,并希望人们申请这些职位。这些欺诈性的雇主侵犯求职者的隐私,制造虚假的工作机会,并导致裁员。我们发现大多数在线招聘欺诈(ORF)具有匹配特征。虽然用户无法对它们进行分类,但我们建议使用各种预测模型,如支持向量机(SVM),人工神经网络(ANN),随机森林,Naïve贝叶斯或物流回归来毫不费力地检测它们。从Kaggle下载了17780个招聘信息的数据集,以确定哪个提议的模型最能预测欺诈性招聘信息。该数据集包括14个特征,用于确定在线招聘是否具有欺诈性。这些招聘信息中有70%用于训练模型,其余30%用于测试模型的效率。每个模型的结果预测使用四个评估指标-分类准确性(CA),精度,召回率和F-1分。研究发现它的适用性有两个方面:一是网站可以在发布虚假招聘信息之前识别出来,二是求职者可以免受欺诈性招聘信息的侵害。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信