基于杜鹃搜索算法的入侵检测特征选择算法

I. Syarif, Rico Fajar Afandi, Ferry Astika Saputra
{"title":"基于杜鹃搜索算法的入侵检测特征选择算法","authors":"I. Syarif, Rico Fajar Afandi, Ferry Astika Saputra","doi":"10.1109/IES50839.2020.9231840","DOIUrl":null,"url":null,"abstract":"High-dimensional data requires a lengthy computation time and is more difficult to model, analyze and visualize. Feature selection algorithm is needed in order to obtain the best features and eliminate irrelevant ones. In this paper, we implement a feature selection algorithm for network intrusion data, in order to detect intrusions on real time network traffic using high accuracy and real time speed. This is very difficult to do if the processed data has a very large number of features.Feature selection algorithm generally consists of two parts: attribute evaluation and search method. Attribute evaluation is the process of scoring the different feature subsets while search methods is used to propose new feature subsets. We apply a Cuckoo Search (CS) as feature selection algorithm into three intrusion datasets: KDD Cup 99, NSL-KDD and Botnet ISCX 2017. We compare the performance of the Cuckoo Search (CS) algorithm with other two Evolutionary Algorithms: Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Our experiments show that CS is better than GA and PSO in reducing the number of intrusion dataset features (ISCX2017) from 79 attributes to 11 (13.9% of the original attributes). In the KDDCup '99 dataset, the CS algorithm reduces the number of attributes from 41 to 13 (31.7% of the original attribute) and in the NSL-KDD dataset, the CS algorithm reduces the number of attributes from 41 to 9 (21.9% of the original attribute). In terms of classification performance, CS is better than PSO in the ISCX2017 botnet dataset, while PSO is superior to CS and GA in the KDDCup '99 and NSL-KDD intrusion datasets.","PeriodicalId":344685,"journal":{"name":"2020 International Electronics Symposium (IES)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Feature Selection Algorithm For Intrusion Detection Using Cuckoo Search Algorithm\",\"authors\":\"I. Syarif, Rico Fajar Afandi, Ferry Astika Saputra\",\"doi\":\"10.1109/IES50839.2020.9231840\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"High-dimensional data requires a lengthy computation time and is more difficult to model, analyze and visualize. Feature selection algorithm is needed in order to obtain the best features and eliminate irrelevant ones. In this paper, we implement a feature selection algorithm for network intrusion data, in order to detect intrusions on real time network traffic using high accuracy and real time speed. This is very difficult to do if the processed data has a very large number of features.Feature selection algorithm generally consists of two parts: attribute evaluation and search method. Attribute evaluation is the process of scoring the different feature subsets while search methods is used to propose new feature subsets. We apply a Cuckoo Search (CS) as feature selection algorithm into three intrusion datasets: KDD Cup 99, NSL-KDD and Botnet ISCX 2017. We compare the performance of the Cuckoo Search (CS) algorithm with other two Evolutionary Algorithms: Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Our experiments show that CS is better than GA and PSO in reducing the number of intrusion dataset features (ISCX2017) from 79 attributes to 11 (13.9% of the original attributes). In the KDDCup '99 dataset, the CS algorithm reduces the number of attributes from 41 to 13 (31.7% of the original attribute) and in the NSL-KDD dataset, the CS algorithm reduces the number of attributes from 41 to 9 (21.9% of the original attribute). In terms of classification performance, CS is better than PSO in the ISCX2017 botnet dataset, while PSO is superior to CS and GA in the KDDCup '99 and NSL-KDD intrusion datasets.\",\"PeriodicalId\":344685,\"journal\":{\"name\":\"2020 International Electronics Symposium (IES)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Electronics Symposium (IES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IES50839.2020.9231840\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Electronics Symposium (IES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IES50839.2020.9231840","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

高维数据需要较长的计算时间,并且更难以建模、分析和可视化。为了获得最佳特征并剔除不相关的特征,需要进行特征选择算法。本文实现了一种针对网络入侵数据的特征选择算法,以高精度和实时性检测实时网络流量中的入侵。如果处理的数据具有非常多的特征,这是非常困难的。特征选择算法一般包括属性评估和搜索方法两部分。属性评估是对不同的特征子集进行评分的过程,而搜索方法则是提出新的特征子集。我们将布谷鸟搜索(CS)作为特征选择算法应用于三个入侵数据集:KDD Cup 99、NSL-KDD和Botnet ISCX 2017。我们比较了布谷鸟搜索(CS)算法与其他两种进化算法:遗传算法(GA)和粒子群优化(PSO)的性能。我们的实验表明,CS在将入侵数据集特征(ISCX2017)的数量从79个属性减少到11个(原始属性的13.9%)方面优于GA和PSO。在KDDCup '99数据集中,CS算法将属性数从41个减少到13个(占原始属性的31.7%),在NSL-KDD数据集中,CS算法将属性数从41个减少到9个(占原始属性的21.9%)。在分类性能方面,CS在ISCX2017僵尸网络数据集中优于PSO,而PSO在KDDCup '99和NSL-KDD入侵数据集中优于CS和GA。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Feature Selection Algorithm For Intrusion Detection Using Cuckoo Search Algorithm
High-dimensional data requires a lengthy computation time and is more difficult to model, analyze and visualize. Feature selection algorithm is needed in order to obtain the best features and eliminate irrelevant ones. In this paper, we implement a feature selection algorithm for network intrusion data, in order to detect intrusions on real time network traffic using high accuracy and real time speed. This is very difficult to do if the processed data has a very large number of features.Feature selection algorithm generally consists of two parts: attribute evaluation and search method. Attribute evaluation is the process of scoring the different feature subsets while search methods is used to propose new feature subsets. We apply a Cuckoo Search (CS) as feature selection algorithm into three intrusion datasets: KDD Cup 99, NSL-KDD and Botnet ISCX 2017. We compare the performance of the Cuckoo Search (CS) algorithm with other two Evolutionary Algorithms: Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Our experiments show that CS is better than GA and PSO in reducing the number of intrusion dataset features (ISCX2017) from 79 attributes to 11 (13.9% of the original attributes). In the KDDCup '99 dataset, the CS algorithm reduces the number of attributes from 41 to 13 (31.7% of the original attribute) and in the NSL-KDD dataset, the CS algorithm reduces the number of attributes from 41 to 9 (21.9% of the original attribute). In terms of classification performance, CS is better than PSO in the ISCX2017 botnet dataset, while PSO is superior to CS and GA in the KDDCup '99 and NSL-KDD intrusion datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信