基于朴素贝叶斯算法粒子群优化的电子政务投诉文本分类

T. Hariguna, Sarmini, A. Hananto
{"title":"基于朴素贝叶斯算法粒子群优化的电子政务投诉文本分类","authors":"T. Hariguna, Sarmini, A. Hananto","doi":"10.1109/CyberneticsCom55287.2022.9865585","DOIUrl":null,"url":null,"abstract":"A web-based online complaint portal is one of the e-government public services. The complaint's content must be categorised in order for it to be transmitted to the appropriate agency swiftly and properly. The most often used standard classification algorithms are the Naive Bayes Classifier (NBC) and k-Nearest Neighbor (k-NN), both of which classify just one label and must be tuned. The purpose of this project is to categorize complaint messages that include several labels simultaneously using NBC tuned for particle swarm optimization (PSO). The data source is the Open Data Jakarta and is partitioned into 70% training data and 30% test data for classification into seven labels. The NBC and k-NN algorithms are used to compare PSO's optimization performance. Cross-validation ten times revealed that optimizing NBC with PSO obtained an accuracy of 88.16%, much superior than k-NN at 83% and NBC at 70.57%. This optimization approach may be used to improve the efficacy of community-based e-government services.","PeriodicalId":178279,"journal":{"name":"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"E-government Public Complaints Text Classification Using Particle Swarm Optimization in Naive Bayes Algorithm\",\"authors\":\"T. Hariguna, Sarmini, A. Hananto\",\"doi\":\"10.1109/CyberneticsCom55287.2022.9865585\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A web-based online complaint portal is one of the e-government public services. The complaint's content must be categorised in order for it to be transmitted to the appropriate agency swiftly and properly. The most often used standard classification algorithms are the Naive Bayes Classifier (NBC) and k-Nearest Neighbor (k-NN), both of which classify just one label and must be tuned. The purpose of this project is to categorize complaint messages that include several labels simultaneously using NBC tuned for particle swarm optimization (PSO). The data source is the Open Data Jakarta and is partitioned into 70% training data and 30% test data for classification into seven labels. The NBC and k-NN algorithms are used to compare PSO's optimization performance. Cross-validation ten times revealed that optimizing NBC with PSO obtained an accuracy of 88.16%, much superior than k-NN at 83% and NBC at 70.57%. This optimization approach may be used to improve the efficacy of community-based e-government services.\",\"PeriodicalId\":178279,\"journal\":{\"name\":\"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CyberneticsCom55287.2022.9865585\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberneticsCom55287.2022.9865585","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于网络的网上投诉门户是电子政务公共服务的一种。投诉的内容必须分类,以便迅速和适当地转交给适当的机构。最常用的标准分类算法是朴素贝叶斯分类器(NBC)和k-最近邻分类器(k-NN),这两种算法都只分类一个标签,并且必须进行调优。本项目的目的是对同时包含多个标签的投诉消息进行分类,使用针对粒子群优化(PSO)进行调优的NBC。数据源为Open data Jakarta,将其划分为70%的训练数据和30%的测试数据,分类为7个标签。用NBC算法和k-NN算法比较了粒子群算法的优化性能。10次交叉验证表明,PSO优化NBC的准确率为88.16%,明显优于k-NN的83%和NBC的70.57%。这种优化方法可用于提高基于社区的电子政务服务的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
E-government Public Complaints Text Classification Using Particle Swarm Optimization in Naive Bayes Algorithm
A web-based online complaint portal is one of the e-government public services. The complaint's content must be categorised in order for it to be transmitted to the appropriate agency swiftly and properly. The most often used standard classification algorithms are the Naive Bayes Classifier (NBC) and k-Nearest Neighbor (k-NN), both of which classify just one label and must be tuned. The purpose of this project is to categorize complaint messages that include several labels simultaneously using NBC tuned for particle swarm optimization (PSO). The data source is the Open Data Jakarta and is partitioned into 70% training data and 30% test data for classification into seven labels. The NBC and k-NN algorithms are used to compare PSO's optimization performance. Cross-validation ten times revealed that optimizing NBC with PSO obtained an accuracy of 88.16%, much superior than k-NN at 83% and NBC at 70.57%. This optimization approach may be used to improve the efficacy of community-based e-government services.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信