A solution representation of genetic algorithm for neural network weights and structure

BatTS: a hybrid method for optimizing deep feedforward neural network

Deep feedforward neural networks (DFNNs) have attained remarkable success in almost every computational task. However, the selection of DFNN architecture is still based on handcraft or hit-and-trial methods. Therefore, an essential factor regarding DFNN is about designing its architecture. Unfortunately, creating architecture for DFNN is a very laborious and time-consuming task for performing state-of-art work. This article proposes a new hybrid methodology (BatTS) to optimize the DFNN architecture based on its performance. BatTS is a result of integrating the Bat algorithm, Tabu search (TS), and Gradient descent with a momentum backpropagation training algorithm (GDM). The main features of the BatTS are the following: a dynamic process of finding new architecture based on Bat, the skill to escape from local minima, and fast convergence in evaluating new architectures based on the Tabu search feature. The performance of BatTS is compared with the Tabu search based approach and random trials. The process goes through an empirical evaluation of four different benchmark datasets and shows that the proposed hybrid methodology has improved performance over existing techniques which are mainly random trials.

A hybrid model integrating long short-term memory with adaptive genetic algorithm based on individual ranking for stock index prediction

Modeling and forecasting stock prices have been important financial research topics in academia. This study seeks to determine whether improvements can be achieved by forecasting a stock index using a hybrid model and incorporating financial variables. We extend the literature on stock market forecasting by applying a hybrid model that combines wavelet transform (WT), long short-term memory (LSTM), and an adaptive genetic algorithm (AGA) based on individual ranking to predict stock indices for the Dow Jones Industrial Average (DJIA) index of the New York Stock Exchange, Standard & Poor's 500 (S&P 500) index, Nikkei 225 index of Tokyo, Hang Seng Index of Hong Kong market, CSI300 index of Chinese mainland stock market, and NIFTY50 index of India. The results indicate an overall improvement in forecasting of the stock index using the AGA-LSTM model compared to the benchmark models. The evaluation indicators prove that this model has a higher prediction accuracy when forecasting six stock indices.

Application of Neural Network Algorithm Combined with Bee Colony Algorithm in English Course Recommendation

The traditional BP neural network has the disadvantages of easy falling into local minimum and slow convergence speed. Aiming at the shortcomings of BP neural network (BP neural network), an artificial bee colony algorithm (ABC) is proposed to cross-optimize the weight and threshold of BP network parameters. This study is mainly about the application of BP neural network algorithm in English curriculum recommendation technology. It includes the application of BP neural network algorithm in English course recommendation technology, English course teaching design mode, the application of BP neural network algorithm in English course, and the optimal combination of bee colony algorithm and BP neural network. After 4690 iterations, the neural network reaches the target accuracy, and the training is completed. At the same time, the prediction error of the model is less than 10%, which further shows that the performance of the prediction model is good. Therefore, the combination model is recommended in this paper. The results show that the optimization algorithm improves the solution accuracy and speeds up the convergence speed of the network.

Genetic Algorithm Based on Natural Selection Theory for Optimization Problems

The metaheuristic genetic algorithm (GA) is based on the natural selection process that falls under the umbrella category of evolutionary algorithms (EA). Genetic algorithms are typically utilized for generating high-quality solutions for search and optimization problems by depending on bio-oriented operators such as selection, crossover, and mutation. However, the GA still suffers from some downsides and needs to be improved so as to attain greater control of exploitation and exploration concerning creating a new population and randomness involvement happening in the population at the solution initialization. Furthermore, the mutation is imposed upon the new chromosomes and hence prevents the achievement of an optimal solution. Therefore, this study presents a new GA that is centered on the natural selection theory and it aims to improve the control of exploitation and exploration. The proposed algorithm is called genetic algorithm based on natural selection theory (GABONST). Two assessments of the GABONST are carried out via (i) application of fifteen renowned benchmark test functions and the comparison of the results with the conventional GA, enhanced ameliorated teaching learning-based optimization (EATLBO), Bat and Bee algorithms. (ii) Apply the GABONST in language identification (LID) through integrating the GABONST with extreme learning machine (ELM) and named (GABONST-ELM). The ELM is considered as one of the most useful learning models for carrying out classifications and regression analysis. The generation of results is carried out grounded upon the LID dataset, which is derived from eight separate languages. The GABONST algorithm has the capability of producing good quality solutions and it also has better control of the exploitation and exploration as compared to the conventional GA, EATLBO, Bat, and Bee algorithms in terms of the statistical assessment. Additionally, the obtained results indicate that (GABONST-ELM)-LID has an effective performance with accuracy reaching up to 99.38%.

Multi-variant differential evolution algorithm for feature selection

This work introduces a new population-based stochastic search technique, named multi-variant differential evolution (MVDE) algorithm for solving fifteen well-known real world problems from UCI repository and compared to four popular optimization methods. The MVDE proposes a new self-adaptive scaling factor based on cosine and logistic distributions as an almost factor-free optimization technique. For more updated chances, this factor is binary-mapped by incorporating an adaptive crossover operator. During the evolution, both greedy and less-greedy variants are managed by adjusting and incorporating the binary scaling factor and elite identification mechanism into a new multi-mutation crossover process through a number of sequentially evolutionary phases. Feature selection decreases the number of features by eliminating irrelevant or misleading, noisy and redundant data which can accelerate the process of classification. In this paper, a new feature selection algorithm based on the MVDE method and artificial neural network is presented which enabled MVDE to get a combination features’ set, accelerate the accuracy of the classification, and optimize both the structure and weights of Artificial Neural Network (ANN) simultaneously. The experimental results show the encouraging behavior of the proposed algorithm in terms of the classification accuracies and optimal number of feature selection.

An Analysis of the KDD99 and UNSW-NB15 Datasets for the Intrusion Detection System

The significant increase in technology development over the internet makes network security a crucial issue. An intrusion detection system (IDS) shall be introduced to protect the networks from various attacks. Even with the increased amount of works in the IDS research, there is a lack of studies that analyze the available IDS datasets. Therefore, this study presents a comprehensive analysis of the relevance of the features in the KDD99 and UNSW-NB15 datasets. Three methods were employed: a rough-set theory (RST), a back-propagation neural network (BPNN), and a discrete variant of the cuttlefish algorithm (D-CFA). First, the dependency ratio between the features and the classes was calculated, using the RST. Second, each feature in the datasets became an input for the BPNN, to measure their ability for a classification task concerning each class. Third, a feature-selection process was carried out over multiple runs, to indicate the frequency of the selection of each feature. From the result, it indicated that some features in the KDD99 dataset could be used to achieve a classification accuracy above 84%. Moreover, a few features in both datasets were found to give a high contribution to increasing the classification’s performance. These features were present in a combination of features that resulted in high accuracy; the features were also frequently selected during the feature selection process. The findings of this study are anticipated to help the cybersecurity academics in creating a lightweight and accurate IDS model with a smaller number of features for the developing technologies.

Kidney-inspired algorithm with reduced functionality treatment for classification and time series prediction

Optimization of an artificial neural network model through the use of optimization algorithms is the common method employed to search for an optimum solution for a broad variety of real-world problems. One such optimization algorithm is the kidney-inspired algorithm (KA) which has recently been proposed in the literature. The algorithm mimics the four processes performed by the kidneys: filtration, reabsorption, secretion, and excretion. However, a human with reduced kidney function needs to undergo additional treatment to improve kidney performance. In the medical field, the glomerular filtration rate (GFR) test is used to check the health of kidneys. The test estimates the amount of blood that passes through the glomeruli each minute. In this paper, we mimic this kidney function test and the GFR result is used to select a suitable step to add to the basic KA process. This novel imitation is designed for both minimization and maximization problems. In the proposed method, depends on GFR test result which is less than 15 or falls between 15 and 60 or is more than 60 a particular action is performed. These additional processes are applied as required with the aim of improving exploration of the search space and increasing the likelihood of the KA finding the optimum solution. The proposed method is tested on test functions and its results are compared with those of the basic KA. Its performance on benchmark classification and time series prediction problems is also examined and compared with that of other available methods in the literature. In addition, the proposed method is applied to a real-world water quality prediction problem. The statistical analysis of all these applications showed that the proposed method had a ability to improve the optimization outcome.