An effective genetic algorithm-based feature selection method for intrusion detection systems

Feature Selection Problem and Metaheuristics: A Systematic Literature Review about Its Formulation, Evaluation and Applications

Feature selection is becoming a relevant problem within the field of machine learning. The feature selection problem focuses on the selection of the small, necessary, and sufficient subset of features that represent the general set of features, eliminating redundant and irrelevant information. Given the importance of the topic, in recent years there has been a boom in the study of the problem, generating a large number of related investigations. Given this, this work analyzes 161 articles published between 2019 and 2023 (20 April 2023), emphasizing the formulation of the problem and performance measures, and proposing classifications for the objective functions and evaluation metrics. Furthermore, an in-depth description and analysis of metaheuristics, benchmark datasets, and practical real-world applications are presented. Finally, in light of recent advances, this review paper provides future research opportunities.

An intelligent protection framework for intrusion detection in cloud environment based on covariance matrix self-adaptation evolution strategy and multi-criteria decision-making

The security defenses that are not comparable to sophisticated adversary tools, let the cloud as an open environment for attacks and intrusions. In this paper, an intelligent protection framework for intrusion detection in a cloud computing environment based on a covariance matrix self-adaptation evolution strategy (CMSA-ES) and multi-criteria decision-making (MCDM) is proposed. The proposed framework constructs an optimal intrusion detector by using CMSA-ES algorithm which adjusts the best parameter set for the attack detector. Moreover, the proposed framework uses a MEREC-VIKOR, a hybrid standardized evaluation technique. MEREC-VIKOR generates the own performance metrics (S, R, and Q) of the proposed framework which is a combination of multi-conflicting criteria. The proposed framework is evaluated for attack detection by using CICIDS 2017 dataset. The experiments show that the proposed framework can detect cloud attacks accurately with low S (utility), R (regret), and Q (integration between S and R). The proposed framework is analyzed with respect to several evolutionary algorithms such as GA, IGASAA, and CMA-ES. The performance analysis demonstrates that the proposed framework that depends on CMSA-ES converges faster than the other evolutionary algorithms such as GA, IGASAA, and CMA-ES. The outcomes also demonstrate that the proposed model is comparable to the state-of-the-art techniques.

Worldwide Prevalence of Alcohol Use in Non-Fatally Injured Motor Vehicle Drivers: A Systematic Review and Meta-Analysis

Drunk driving is an important risk factor significantly contributing to traffic accidents and their associated lethality. This meta-analysis of observational studies aims to provide the estimates of drunk driving prevalence in non-lethally injured motor vehicle drivers in relation to the world region, blood alcohol concentration (BAC), and quality of the primary study. A systematic search for observational studies that examined the prevalence of drunk driving in injured drivers was performed, and 17 studies comprising 232,198 drivers were included in the pooled analysis. The pooled prevalence of drunk driving in injured drivers was found to be 16.6% (95% CI: 12.8-20.3%; I² = 99.87%, p < 0.001). In addition, the prevalence of alcohol use ranged from 5.5% (95% CI: 0.8-10.1%) in the Middle East, North Africa, and Greater Arabia region to 30.6% (95% CI: 24.6-36.5%) in the Asia region. As for the subgroups with different thresholds of BAC, the maximum value of 34.4% (95% CI: 28.5-40.3%) was found for a dose of 0.3 g/L. The prevalence of alcohol use reported by high-quality studies was 15.7% (95% CI: 11.1-20.3%), compared to 17.7% (95% CI: 11.3-24.2%) reported by studies of moderate quality. These findings could inform law enforcement efforts to promote road safety.

An intrusion detection method based on granular autoencoders

Intrusion detection systems have become one of the important tools for network security due to the frequent attacks brought about by the explosive growth of network traffic. Autoencoder is an unsupervised learning model with a neural network structure. It has a powerful feature learning capability and is effective in intrusion detection. However, its network construction suffers from overfitting and gradient disappearance problems. Traditional granular computing methods have advantages in solving such problems, but the process is relatively complex, the granularity dimension is high, and the computational cost is large, which is not suitable for application in intrusion detection systems. To address these problems, we propose a novel autoencoder: Granular AutoEncoders (GAE). The granulation reference set is constructed by random sampling. The granulation of training samples is based on single-feature similarity in a reference set to form granules. The granulation of multiple features results in granular vectors. Some operations of granules are defined. Furthermore, we propose some granular measures, including granular norms and granular loss functions. The GAE is further applied to the field of intrusion detection by designing an anomaly detection algorithm based on the GAE. The algorithm determines whether the network flows are anomalous by comparing the difference between an input granular vector and its output granular vector that is reconstructed by the GAE. Finally, some experiments are conducted using an intrusion detection dataset, comparing multiple metrics in terms of precision, recall, and F1-Score. The experimental results validate the correctness and effectiveness of the intrusion detection method based on GAE. And contrast experiments show that the proposed method has stronger ability for detecting anomalies than the correlation algorithms.

Robot path planning based on shuffled frog leaping algorithm combined with genetic algorithm

When the shuffled frog leaping algorithm (SFLA) is used to solve the robot path planning problem in obstacle environment, the quality of the initial solution is not high, and the algorithm is easy to fall into local optimization. Herein, an improved SFLA named ISFLA combined with genetic algorithm is proposed. By introducing selection, crossover and mutation operators in genetic algorithm, the ISFLA not only improves the solution quality of the SFLA, but also accelerates its convergence speed. Moreover, the ISFLA also proposes a location update strategy based on the central frog, which makes full use of the global information to avoid the algorithm falling into local optimization. By comparing ISFLA with other algorithms including SFLA in the map environment of different obstacles, it is confirmed that ISFLA can effectively improve the minimum path optimization and robustness in the simulation experiments of mobile robots.

Optimization of Intrusion Detection Systems Determined by Ameliorated HNADAM-SGD Algorithm

Information security is of pivotal concern for consistently streaming information over the widespread internetwork. The bottleneck flow of incoming and outgoing data traffic introduces the issues of malicious activities taken place by intruders, hackers and attackers in the form of authenticity obstruction, gridlocking data traffic, vandalizing data and crashing the established network. The issue of emerging suspicious activities is managed by the domain of Intrusion Detection Systems (IDS). The IDS consistently monitors the network for the identification of suspicious activities, and generates alarm and indication in the presence of malicious threats and worms. The performance of IDS is improved by using different machine learning algorithms. In this paper, the Nesterov-Accelerated Adaptive Moment Estimation–Stochastic Gradient Descent (HNADAM-SDG) algorithm is proposed to determine the performance of Intrusion Detection Systems IDS. The algorithm is used to optimize IDS systems by hybridization and tuning of hyperparameters. The performance of algorithm is compared with other classification algorithms such as logistic regression, ridge classifier and ensemble algorithms where the experimental analysis and computations show the improved accuracy with 99.8%, sensitivity with 99.7%, and specificity with 99.5%.