The rapid development and popularization of the network have brought many problems to network security. Intrusion detection technology is often used as an effective security technology to protect the network. The deep belief network (DBN), as a classic model of deep learning, has good classification performance and is often used in the field of intrusion detection. However, the network structure of DBN is generally set through practical experience. For the optimization problem of the DBN-based intrusion detection classification model (DBN-IDS), this paper proposes a new joint optimization algorithm to optimize the DBN's network structure. First, we design a particle swarm optimization (PSO) based on the adaptive inertia weight and learning factor. Second, we use the fish swarm behavior of cluster, foraging, and other behaviors to optimize the PSO to find the initial optimization solution. Then, based on the initial optimization solution, we use the genetic operators with self-adjusting crossover probability and mutation probability to optimize the PSO to search the global optimization solution. Finally, the global optimization solution constructed by the above-mentioned joint optimization algorithm is used as the network structure of the intrusion detection classification model. The experimental results show that compared with other DBN-IDS optimization algorithms, our algorithm shortens the average detection time by at least 24.69% on the premise of increasing the average training time by 6.9%; compared with the tested classification algorithms, our DBN-IDS improves the average classification accuracy by at least 1.3% and up to 14.80% in the five-category classification, which is proved to be an efficient DBN-IDS optimization method.

/pdf/an-optimization-method-for-intrusion-detection-1ttpfmv3hs.pdf

An Optimization Method for Intrusion Detection Classification Model Based on Deep Belief Network

DLGA-PDE: Discovery of PDEs with incomplete candidate library via combination of deep learning and genetic algorithm

A chaotic strategy-based quadratic Opposition-Based Learning adaptive variable-speed whale optimization algorithm

This paper presents a novel meta-heuristic algorithm called Ali Baba and the forty thieves (AFT) for solving global optimization problems. Recall the famous tale of Ali Baba and the forty thieves, where Ali Baba once saw a gang of forty thieves enter a strange cave filled with all kinds of treasures. The strategies pursued by the forty thieves in the search for Ali Baba inspired us to design ideas and underlie the basic concepts to put forward the mathematical models and implement the exploration and exploitation processes of the proposed algorithm. The performance of the AFT algorithm was assessed on a set of basic benchmark test functions and two more challenging benchmarks called IEEE CEC-2017 and IEEE CEC-C06 2019 benchmark test functions. These benchmarks cover simple and complex test functions with various dimensions and levels of complexity. An extensive comparative study was performed between the AFT algorithm and other well-studied algorithms, and the significance of the results was proved by statistical test methods. To study the potential performance of AFT, its further development is discussed and carried out from five aspects. Finally, the applicability of the AFT algorithm was subsequently demonstrated in solving five engineering design problems. The results in both benchmark functions and engineering problems show that the AFT algorithm has stronger performance than other competitors’ algorithms.

A novel meta-heuristic algorithm for solving numerical optimization problems: Ali Baba and the forty thieves

The salp swarm algorithm (SSA) is a bio-heuristic optimization algorithm proposed in 2017. It has been proved that SSA has competitive results compared to several other well-known meta-heuristic algorithms on various optimization problem. However, like most meta-heuristic algorithms, SSA is prone to problems such as local optimal solution and a slow convergence rate. To solve these problems, a chaotic salp swarm algorithm based on opposition-based learning (OCSSA) is proposed. The application of opposition-based learning (OBL) guarantees a better convergence speed and better develops the search space. The chaotic local search (CLS) method is also introduced, which can improve the performance of the algorithm to obtain the global optimal solution. The performance of OCSSA is compared with that of the original SSA and some other meta-heuristic algorithms on 28 benchmark functions with unimodal or multimodal characteristics. The experimental results show that the performance of OCSSA, with an appropriate chaotic map, is better than or comparable with the SSA and other meta-heuristic algorithms.

/pdf/an-opposition-based-chaotic-salp-swarm-algorithm-for-global-uy7uou3l5m.pdf

An Opposition-Based Chaotic Salp Swarm Algorithm for Global Optimization

To avoid problems such as premature convergence and falling into a local optimum, this paper proposes an improved real-coded genetic algorithm (RCGA-rdn) to improve the performance in solving numerical function optimization. These problems are mainly caused by the poor search ability of the algorithm and the loss of population diversity. Therefore, to improve the search ability, the algorithm integrates three specially designed operators: ranking group selection (RGS), direction-based crossover (DBX) and normal mutation (NM). In contrast to the traditional strategy framework, RCGA-rdn introduces a new step called the replacement operation, which periodically performs a local initialization operation on the population to increase the population diversity. In this paper, comparisons with several advanced algorithms were performed on 21 complex constrained optimization problems and 10 high-dimensional unconstrained optimization problems to verify the effectiveness of RCGA-rdn. Based on the results, to further verify the feasibility of the algorithm, it was applied to a series of practical engineering optimization problems. The experimental results show that the proposed operations can effectively improve the performance of the algorithm. Compared with the other algorithms, the improved algorithm (RCGA-rdn) has a better search ability, faster convergence speed and can maintain a certain population diversity.

Fulin Wang

Papers

An improved genetic algorithm for numerical function optimization