带有投票分类器的入侵检测系统算法优化器

Amir Soltany Mahboob, Mohammad Reza Ostadi Moghaddam, S. Yousefi
{"title":"带有投票分类器的入侵检测系统算法优化器","authors":"Amir Soltany Mahboob, Mohammad Reza Ostadi Moghaddam, S. Yousefi","doi":"10.1109/IKT54664.2021.9685429","DOIUrl":null,"url":null,"abstract":"Intrusion Detection System (IDS) has been an imperative challenge in Computer Networks. Commonly, based on the network traffic and large amount of transmitted data in the network, solutions preventing misdiagnosis of attacks and increasing the accuracy of intrusion detection has been proposed by researchers. To address the mentioned challenge, in this paper we propose a hybrid IDS using an Arithmetic Optimizer Algorithm (AOA) and Majority Vote Classifier (MVC) for computer networks. First, the optimal feature subset is selected by the Arithmetic Optimizer Algorithm and then a MVC is used to classify the samples. MVC utilizes Naive Bayes (NB), Decision Tree (DT), and k-nearest neighbors (KNN). The efficiency of the proposed method has been evaluated using the UNSW-NB15 dataset and the results have been compared with other methods such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Differential Evolution (DE) as well as similar methods. Experimental results show better performance of the proposed method in terms of higher intrusion detection accuracy and fewer features compared to other similar studies.","PeriodicalId":274571,"journal":{"name":"2021 12th International Conference on Information and Knowledge Technology (IKT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"AOV-IDS: Arithmetic Optimizer with Voting classifier for Intrusion Detection System\",\"authors\":\"Amir Soltany Mahboob, Mohammad Reza Ostadi Moghaddam, S. Yousefi\",\"doi\":\"10.1109/IKT54664.2021.9685429\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Intrusion Detection System (IDS) has been an imperative challenge in Computer Networks. Commonly, based on the network traffic and large amount of transmitted data in the network, solutions preventing misdiagnosis of attacks and increasing the accuracy of intrusion detection has been proposed by researchers. To address the mentioned challenge, in this paper we propose a hybrid IDS using an Arithmetic Optimizer Algorithm (AOA) and Majority Vote Classifier (MVC) for computer networks. First, the optimal feature subset is selected by the Arithmetic Optimizer Algorithm and then a MVC is used to classify the samples. MVC utilizes Naive Bayes (NB), Decision Tree (DT), and k-nearest neighbors (KNN). The efficiency of the proposed method has been evaluated using the UNSW-NB15 dataset and the results have been compared with other methods such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Differential Evolution (DE) as well as similar methods. Experimental results show better performance of the proposed method in terms of higher intrusion detection accuracy and fewer features compared to other similar studies.\",\"PeriodicalId\":274571,\"journal\":{\"name\":\"2021 12th International Conference on Information and Knowledge Technology (IKT)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 12th International Conference on Information and Knowledge Technology (IKT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IKT54664.2021.9685429\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 12th International Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT54664.2021.9685429","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

入侵检测系统(IDS)已成为计算机网络中一个迫切需要解决的问题。通常,研究人员根据网络流量和网络中传输的大量数据,提出了防止攻击误诊和提高入侵检测准确性的解决方案。为了解决上述挑战,在本文中,我们提出了一种使用算术优化算法(AOA)和多数投票分类器(MVC)的计算机网络混合IDS。首先,通过算术优化算法选择最优特征子集,然后使用MVC对样本进行分类。MVC利用朴素贝叶斯(NB)、决策树(DT)和k近邻(KNN)。利用UNSW-NB15数据集对该方法的有效性进行了评价,并与粒子群优化(PSO)、遗传算法(GA)、差分进化(DE)等方法进行了比较。实验结果表明,与其他类似研究相比,该方法具有更高的入侵检测精度和更少的特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
AOV-IDS: Arithmetic Optimizer with Voting classifier for Intrusion Detection System
Intrusion Detection System (IDS) has been an imperative challenge in Computer Networks. Commonly, based on the network traffic and large amount of transmitted data in the network, solutions preventing misdiagnosis of attacks and increasing the accuracy of intrusion detection has been proposed by researchers. To address the mentioned challenge, in this paper we propose a hybrid IDS using an Arithmetic Optimizer Algorithm (AOA) and Majority Vote Classifier (MVC) for computer networks. First, the optimal feature subset is selected by the Arithmetic Optimizer Algorithm and then a MVC is used to classify the samples. MVC utilizes Naive Bayes (NB), Decision Tree (DT), and k-nearest neighbors (KNN). The efficiency of the proposed method has been evaluated using the UNSW-NB15 dataset and the results have been compared with other methods such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Differential Evolution (DE) as well as similar methods. Experimental results show better performance of the proposed method in terms of higher intrusion detection accuracy and fewer features compared to other similar studies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信