Technical Job Distribution at BSD SHARP Service Center Using Combination of Naïve Bayes and K-Nearest Neighbour

Dwi Pebrianti, Angga Ariawan, L. Bayuaji, Deni Mahdiana, Rusdah Rusdah
{"title":"Technical Job Distribution at BSD SHARP Service Center Using Combination of Naïve Bayes and K-Nearest Neighbour","authors":"Dwi Pebrianti, Angga Ariawan, L. Bayuaji, Deni Mahdiana, Rusdah Rusdah","doi":"10.1109/ISWTA55313.2022.9942772","DOIUrl":null,"url":null,"abstract":"Works distribution is a routine carried out every day by the head of the branch in the SHARP Service Center. The accuracy of the labor division is very important to get customer satisfaction. Inappropriate work distribution can increase complaints from customers. Currently, works distribution in SHARP Service Center is carried out manually, where the works received on the selected system is then shared through the document provided. Time taken for this process is about 1.42 minutes on average for each damage reports. Speed of Service also depends on the Head of Department's expertise and experience. In this study, an automatic system based on Machine Learning will be designed for the technicians work distribution by using a combination of k Nearest Neighbor (k-NN) and Naïve Bayes. Naïve Bayes algorithm is used to improve the feature extraction accuracy by considering the feature below the average (α). Meanwhile, k-NN algorithm is used to classify the experimental data. From the study, it is found that the best of k value for k-NN algorithm is 15. It is known that a high number of accuracy values, the labor distribution can be more accurate. The validation of the proposed method is conducted by using a confusion matrix with a composition of 80% training data and 20% test data. The single Classifier test with the Naïve Bayes algorithm produces the highest accuracy value of 72.7%, while using k-NN algorithm is 81.5%. With a combination of Naive Bayes and k-NN algorithms, the accuracy value is increasing to 86%. This result shows that the proposed method improves the accuracy by 13.3% on single Naive Bayes algorithms and 4% on a single k-NN algorithm. The results obtained show that in the manual process, the average time per job is 1.42 minutes, while by using the proposed method, the average processing time is around 0.03 seconds per job. An increase of 2480 times faster is found and confirmed during the implementation of the proposed method.","PeriodicalId":293957,"journal":{"name":"2022 IEEE Symposium on Wireless Technology & Applications (ISWTA)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Symposium on Wireless Technology & Applications (ISWTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWTA55313.2022.9942772","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Works distribution is a routine carried out every day by the head of the branch in the SHARP Service Center. The accuracy of the labor division is very important to get customer satisfaction. Inappropriate work distribution can increase complaints from customers. Currently, works distribution in SHARP Service Center is carried out manually, where the works received on the selected system is then shared through the document provided. Time taken for this process is about 1.42 minutes on average for each damage reports. Speed of Service also depends on the Head of Department's expertise and experience. In this study, an automatic system based on Machine Learning will be designed for the technicians work distribution by using a combination of k Nearest Neighbor (k-NN) and Naïve Bayes. Naïve Bayes algorithm is used to improve the feature extraction accuracy by considering the feature below the average (α). Meanwhile, k-NN algorithm is used to classify the experimental data. From the study, it is found that the best of k value for k-NN algorithm is 15. It is known that a high number of accuracy values, the labor distribution can be more accurate. The validation of the proposed method is conducted by using a confusion matrix with a composition of 80% training data and 20% test data. The single Classifier test with the Naïve Bayes algorithm produces the highest accuracy value of 72.7%, while using k-NN algorithm is 81.5%. With a combination of Naive Bayes and k-NN algorithms, the accuracy value is increasing to 86%. This result shows that the proposed method improves the accuracy by 13.3% on single Naive Bayes algorithms and 4% on a single k-NN algorithm. The results obtained show that in the manual process, the average time per job is 1.42 minutes, while by using the proposed method, the average processing time is around 0.03 seconds per job. An increase of 2480 times faster is found and confirmed during the implementation of the proposed method.
结合Naïve贝叶斯和k近邻的BSD SHARP服务中心技术岗位分配
工作分配是夏普服务中心分公司负责人每天进行的例行工作。分工的准确性是客户满意度的重要保证。不恰当的工作分配会增加客户的投诉。目前,SHARP服务中心的作品分发是手动进行的,在选定的系统上接收到的作品,然后通过提供的文档进行共享。每一份损坏报告平均耗时1.42分钟。服务的速度也取决于部门主管的专业知识和经验。在本研究中,将采用k近邻(k- nn)和Naïve贝叶斯相结合的方法,设计一个基于机器学习的技术人员工作分配自动化系统。Naïve采用贝叶斯算法,通过考虑低于平均值(α)的特征来提高特征提取的精度。同时,采用k-NN算法对实验数据进行分类。通过研究发现,k- nn算法的最佳k值为15。众所周知,数值精度高,劳动力分布才能更准确。使用由80%的训练数据和20%的测试数据组成的混淆矩阵对所提出的方法进行验证。使用Naïve Bayes算法的单分类器测试准确率最高,为72.7%,而使用k-NN算法的准确率为81.5%。结合朴素贝叶斯和k-NN算法,准确率提高到86%。结果表明,该方法比单一朴素贝叶斯算法的准确率提高了13.3%,比单一k-NN算法的准确率提高了4%。结果表明,在手工加工过程中,每个作业的平均加工时间为1.42分钟,而采用本文提出的方法,每个作业的平均加工时间约为0.03秒。在该方法的实施过程中,发现并确认了提高2480倍的速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信