An Improved Binary Grey-Wolf Optimizer with Simulated Annealing for Feature Selection

This paper proposes improvements to the binary grey-wolf optimizer (BGWO) to solve the feature selection (FS) problem associated with high data dimensionality, irrelevant, noisy, and redundant data that will then allow machine learning algorithms to attain better classification/clustering accuracy in less training time. We propose three variants of BGWO in addition to the standard variant, applying different transfer functions to tackle the FS problem. Because BGWO generates continuous values and FS needs discrete values, a number of V-shaped, S-shaped, and U-shaped transfer functions were investigated for incorporation with BGWO to convert their continuous values to binary. After investigation, we note that the performance of BGWO is affected by the selection of the transfer function. Then, in the first variant, we look to reduce the local minima problem by integrating an exploration capability to update the position of the grey wolf randomly within the search space with a certain probability; this variant was abbreviated as IBGWO. Consequently, a novel mutation strategy is proposed to select a number of the worst grey wolves in the population which are updated toward the best solution and randomly within the search space based on a certain probability to determine if the update is either toward the best or randomly. The number of the worst grey wolf selected by this strategy is linearly increased with the iteration. Finally, this strategy is combined with IBGWO to produce the second variant of BGWO that was abbreviated as LIBGWO. In the last variant, simulated annealing (SA) was integrated with LIBGWO to search around the best-so-far solution at the end of each iteration in order to identify better solutions. The performance of the proposed variants was validated on 32 datasets taken from the UCI repository and compared with six wrapper feature selection methods. The experiments show the superiority of the proposed improved variants in producing better classification accuracy than the other selected wrapper feature selection algorithms

Improved feature selection using a hybrid side-blotched lizard algorithm and genetic algorithm approach

Feature selection entails choosing the significant features among a wide collection of original features that are essential for predicting test data using a classifier. Feature selection is commonly used in various applications, such as bioinformatics, data mining, and the analysis of written texts, where the dataset contains tens or hundreds of thousands of features, making it difficult to analyze such a large feature set. Removing irrelevant features improves the predictor performance, making it more accurate and cost-effective. In this research, a novel hybrid technique is presented for feature selection that aims to enhance classification accuracy. A hybrid binary version of side-blotched lizard algorithm (SBLA) with genetic algorithm (GA), namely SBLAGA, which combines the strengths of both algorithms is proposed. We use a sigmoid function to adapt the continuous variables values into a binary one, and evaluate our proposed algorithm on twenty-three standard benchmark datasets. Average classification accuracy, average number of selected features and average fitness value were the evaluation criteria. According to the experimental results, SBLAGA demonstrated superior performance compared to SBLA and GA with regards to these criteria. We further compare SBLAGA with four wrapper feature selection methods that are widely used in the literature, and find it to be more efficient

A NOVEL AND HYBRID WHALE OPTIMIZATION WITH RESTRICTED CROSSOVER AND MUTATION BASED FEATURE SELECTION METHOD FOR ANXIETY AND DEPRESSION

Introduction: Anxiety and depression are two leading human psychological disorders. In this work, several swarm intelligence- based metaheuristic techniques have been employed to find an optimal feature set for the diagnosis of these two human psychological disorders. Subjects and Methods: To diagnose depression and anxiety among people, a random dataset comprising 1128 instances and 46 attributes has been considered and examined. The dataset was collected and compiled manually by visiting the number of clinics situated in different cities of Haryana (one of the states of India). Afterwards, nine emerging meta-heuristic techniques (Genetic algorithm, binary Grey Wolf Optimizer, Ant Colony Optimization, Particle Swarm Optimization, Artificial Bee Colony, Firefly Algorithm, Dragonfly Algorithm, Bat Algorithm and Whale Optimization Algorithm) have been employed to find the optimal feature set used to diagnose depression and anxiety among humans. To avoid local optima and to maintain the balance between exploration and exploitation, a new hybrid feature selection technique called Restricted Crossover Mutation based Whale Optimization Algorithm (RCM-WOA) has been designed. Results: The swarm intelligence-based meta-heuristic algorithms have been applied to the datasets. The performance of these algorithms has been evaluated using different performance metrics such as accuracy, sensitivity, specificity, precision, recall, f-measure, error rate, execution time and convergence curve. The rate of accuracy reached utilizing the proposed method RCM-WOA is 91.4%. Conclusion: Depression and Anxiety are two critical psychological disorders that may lead to other chronic and life-threatening human disorders. The proposed algorithm (RCM-WOA) was found to be more suitable compared to the other state of art methods

An innovative metaheuristic strategy for solar energy management through a neural networks framework

Proper management of solar energy as an effective renewable source is of high importance toward sustainable energy harvesting. This paper offers a novel sophisticated method for predicting solar irradiance (SIr) from environmental conditions. To this end, an efficient metaheuristic technique, namely electromagnetic field optimization (EFO), is employed for optimizing a neural network. This algorithm quickly mines a publicly available dataset for nonlinearly tuning the network parameters. To suggest an optimal configuration, five influential parameters of the EFO are optimized by an extensive trial and error practice. Analyzing the results showed that the proposed model can learn the SIr pattern and predict it for unseen conditions with high accuracy. Furthermore, it provided about 10% and 16% higher accuracy compared to two benchmark optimizers, namely shuffled complex evolution and shuffled frog leaping algorithm. Hence, the EFO-supervised neural network can be a promising tool for the early prediction of SIr in practice. The findings of this research may shed light on the use of advanced intelligent models for efficient energy development

A Tent L\'evy Flying Sparrow Search Algorithm for Feature Selection: A COVID-19 Case Study

The "Curse of Dimensionality" induced by the rapid development of information science, might have a negative impact when dealing with big datasets. In this paper, we propose a variant of the sparrow search algorithm (SSA), called Tent L\'evy flying sparrow search algorithm (TFSSA), and use it to select the best subset of features in the packing pattern for classification purposes. SSA is a recently proposed algorithm that has not been systematically applied to feature selection problems. After verification by the CEC2020 benchmark function, TFSSA is used to select the best feature combination to maximize classification accuracy and minimize the number of selected features. The proposed TFSSA is compared with nine algorithms in the literature. Nine evaluation metrics are used to properly evaluate and compare the performance of these algorithms on twenty-one datasets from the UCI repository. Furthermore, the approach is applied to the coronavirus disease (COVID-19) dataset, yielding the best average classification accuracy and the average number of feature selections, respectively, of 93.47% and 2.1. Experimental results confirm the advantages of the proposed algorithm in improving classification accuracy and reducing the number of selected features compared to other wrapper-based algorithms

A Novel Approach for Optimization of Convolution Neural Network with Particle Swarm Optimization and Genetic Algorithm for Face Recognition

Convolutional neural networks are contemporary deep learning models that are employed for many various applications. In general, the filter size, number of filters, number of convolutional layers, number of fully connected layers, activation function and learning rate are some of the hyperparameters that significantly determine how well a CNN performs.. Generally, these hyperparameters are selected manually and varied for each CNN model depending on the application and dataset. During optimization, CNN could get stuck in local minima. To overcome this, metaheuristic algorithms are used for optimization. In this work, the CNN structure is first constructed with randomly chosen hyperparameters and these parameters are optimized using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithm. A CNN with optimized hyperparameters is used for face recognition. CNNs optimized with these algorithms use RMSprop optimizer instead of stochastic gradient descent. This RMSprop optimizer helps the CNN reach global minimum quickly. It has been observed that optimizing with GA and PSO improves the performance of CNNs. It also reduces the time it takes for the CNN to reach the global minimum

Electrical power prediction through a combination of multilayer perceptron with water cycle ant lion and satin bowerbird searching optimizers

Predicting the electrical power (PE) output is a significant step toward the sustainable development of combined cycle power plants. Due to the effect of several parameters on the simulation of PE, utilizing a robust method is of high importance. Hence, in this study, a potent metaheuristic strategy, namely, the water cycle algorithm (WCA), is employed to solve this issue. First, a nonlinear neural network framework is formed to link the PE with influential parameters. Then, the network is optimized by the WCA algorithm. A publicly available dataset is used to feed the hybrid model. Since the WCA is a population-based technique, its sensitivity to the population size is assessed by a trial-and-error effort to attain the most suitable configuration. The results in the training phase showed that the proposed WCA can find an optimal solution for capturing the relationship between the PE and influential factors with less than 1% error. Likewise, examining the test results revealed that this model can forecast the PE with high accuracy. Moreover, a comparison with two powerful benchmark techniques, namely, ant lion optimization and a satin bowerbird optimizer, pointed to the WCA as a more accurate technique for the sustainable design of the intended system. Lastly, two potential predictive formulas, based on the most efficient WCAs, are extracted and presented

VGG19+CNN: Deep Learning-Based Lung Cancer Classification with Meta-Heuristic Feature Selection Methodology

Lung illnesses are lung-affecting illnesses that harm the respiratory mechanism. Lung cancer is one of the major causes of death in humans internationally. Advance diagnosis could optimise survivability amongst humans. This remains feasible to systematise or reinforce the radiologist for cancer prognosis. PET and CT scanned images can be used for lung cancer detection. On the whole, the CT scan exhibits importance on the whole and functions as a comprehensive operation in former cancer prognosis. Thus, to subdue specific faults in choosing the feature and optimise classification, this study employs a new revolutionary algorithm called the Accelerated Wrapper-based Binary Artificial Bee Colony algorithm (AWBABCA) for effectual feature selection and VGG19+CNN for classifying cancer phases. The morphological features will be extracted out of the pre-processed image; next, the feature or nodule related to the lung that possesses a significant impact on incurring cancer will be chosen, and for this intention, herein AWBABCA has been employed. The chosen features will be utilised for cancer classification, facilitating a great level of strength and precision. Using the lung dataset to do an experimental evaluation shows that the proposed classifier got the best accuracy, precision, recall, and f1-score

Crow search algorithm with time varying flight length strategies for feature selection

Feature Selection (FS) is an efficient technique use to get rid of irrelevant, redundant and noisy attributes in high dimensional datasets while increasing the efficacy of machine learning classification. The CSA is a modest and efficient metaheuristic algorithm which has been used to overcome several FS issues. The flight length (fl) parameter in CSA governs crows\u27 search ability. In CSA, fl is set to a fixed value. As a result, the CSA is plagued by the problem of being hoodwinked in local minimum. This article suggests a remedy to this issue by bringing five new concepts of time dependent fl in CSA for feature selection methods including linearly decreasing flight length, sigmoid decreasing flight length, chaotic decreasing flight length, simulated annealing decreasing flight length, and logarithm decreasing flight length. The proposed approaches\u27 performance is assessed using 13 standard UCI datasets. The simulation result portrays that the suggested feature selection approaches overtake the original CSA, with the chaotic-CSA approach beating the original CSA and the other four proposed approaches for the FS task