Intrusion Detection Using Normalized Mutual Information Feature Selection and Parallel Quantum Genetic Algorithm

Intrusion Detection Using Normalized Mutual Information Feature Selection and Parallel Quantum Genetic Algorithm

Zhang Ling, Zhang Jia Hao
Copyright: © 2022 |Pages: 24
DOI: 10.4018/IJSWIS.307324
Article PDF Download
Open access articles are freely available for download

Abstract

This paper presents a detection algorithm using normalized mutual information feature selection and cooperative evolution of multiple operators based on adaptive parallel quantum genetic algorithm (NMIFS MOP- AQGA). The proposed algorithm is to address the problems that the intrusion detection system (IDS) has lower the detection speed, less adaptability and lower detection accuracy. In order to achieve an effective reduction for high-dimensional feature data, the NMIFS method is used to select the best feature combination. The best features are sent to the MOP- AQGA classifier for learning and training, and the intrusion detectors are obtained. The data are fed into the detection algorithm to ultimately generate accurate detection results. The experimental results on real abnormal data demonstrate that the NMIFS MOP- AQGA method has higher detection accuracy, lower false negative rate and higher adaptive performance than the existing detection methods, especially for small samples sets.
Article Preview
Top

Introduction

IDS is proved to be an effective method of network security defense (Teng et al., 2020). Many researchers have used machine learning algorithms (Alyaseen et al., 2017; Kumar et al., 2019; Li et al., 2019) to research IDS, such as deep learning, support vector machine (SVM), fuzzy sets, outliers and random forest, and genetic algorithm, and have made many breakthroughs.

On the one hand, there are a large amount of network logs for IDS to detect, so an effective algorithm should be researched to delete the redundant features to improve the detection speed. There are some features selection algorithms used to reduce the redundant features, such as rough set, fuzzy set, and so on.

Feature selection algorithm (FSA) is introduced as a pretreatment to the anomaly detection to optimize existing classifiers. FSA can eliminate irrelevant and redundant features, reduce computational complexity, and improve the accuracy of the learning algorithms (Chunhui & Wenjuan, 2021; Ying- Wu et al., 2010).

Este´vez et al. (2009) designed a Mutual Information Feature Selection (MIFS) method. However, in the MIFS algorithm, the increase of the input features can easily lead to some irrelevant feature selections (Lashkia et al., 2004). Peng et al. (2014) proposed a minimal- Redundancy- Maximal- Relevance (mRMR) criteria, with which the impact of parameter β through the average of redundancy values was decreased. This criterion has a very low expense to give feature selection, but the entropy may vary considerably. Panigrahi (2021) gave an improved infinite feature selection for multiclass classification (IIFS-MC) to eliminate the superfluous attributes.

To increases the speed and deviation of mutual information among multi-valued attributes, the values of features are normalized in [0, 1]. The authors gave a NMIFS to reduce the algorithm complexity and obtain the optimal features. The experiment results showed that the NMIFS method has better performance on feature selection on several benchmark problems.

On the other hand, the classifier will directly affect the accuracy of anomaly detection (Yilei et al., 2021). JooHwa and KeeHyun (2019) designed an IDS with autoencoder - conditional, the generative adversarial networks and the random forest (AE - CGAN - RF), autoencoder-conditional method was adopted to reduce high-dimensional data dimension and to get a higher detection rate. Jiadong et al. (2019) gave a hybrid multilevel intrusion detection model. The outliers detection algorithm can effectively reduce some redundant attributes and improve the speed of detection. Alyaseen et al. (2017) used K - means algorithm to achieve training data set in a multilevel hybrid intrusion detection model, with which, they got better performance of classifiers. Yang et al. (2019) proposed an Effective IDS using the Modified Density Peak Clustering Algorithm and Deep Belief Networks (MDPCA-DBN). They used the Modified Density Peak Clustering Algorithm and Deep Networks to reduce the size of the training set, solve the imbalance of sample, and improve the efficiency of detection. Song et al. (2018) proposed an anti-adversarial hidden markov model for network-based intrusion detection (AA-HMM). However those algorithms had lower self-adaptability, lower detection rate, and higher false alert rate for small samples sets.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2024)
Volume 19: 1 Issue (2023)
Volume 18: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing