Binary Whale Optimization Algorithm Research Articles

Detection of chronic kidney disease using binary whale optimization algorithm

Chronic kidney disease (CKD), a medical illness, is characterized by a steady deterioration in kidney function. A disease's ability to be prevented and effectively significantly treated depends on early diagnosis. The addition of filter feature selection to the machine learning algorithm has been done to detect CKD. However, the quality of its feature subset is not optimal. Wrapper feature selection can improve the quality of these feature subsets. Therefore, we proposed wrapper feature selection and binary whale optimization algorithm (BWOA) to enhance the accuracy of early CKD detection. We also make data improvements to improve accuracy, namely the preprocessing process with the median and modus techniques. We used a public dataset of 250 medical records of kidney sufferers and 150 completely healthy people. There are 24 features in this dataset. The test results showed that adding BWOA feature selection can increase accuracy. The proposed method produced an accuracy of 100%. Further research on these methods can be used to develop expert systems for early detection of CKD.

Construction of an Intelligent Identification Model for Drugs in Near Infrared Spectroscopy and Research on Drog Classification based on Improved Deep Algorithm

Near-infrared spectroscopy has important applications in drug and food identification. Combining machine learning with near-infrared spectroscopy to achieve intelligent identification of drugs has become a research hotspot in recent years. To solve the problem of machine learning’s inefficiency in classifying small-scale data, a drug identification model based on near-infrared spectroscopy combined with a random fading depth belief network is proposed. Aiming at the problem that the training time of the machine learning algorithm is too long, the extreme learning machine is used to replace the back propagation algorithm to optimize the stack sparse auto-encoder network. Additionally, the stack sparse auto-encoder algorithm based on extreme learning machine algorithm is constructed. The study found that the precision of the Dropout Deep Belief Network model was 99.12%, which was higher than the other three models. Additionally, the area under the curve value of the Dropout Deep Belief Network model was 0.87, which was 0.04 higher than the binary whale optimization algorithm model, 0.26 higher than the factor decomposition machine and depth neural network model, and 0.05 higher than the random forest network model. The sparse auto-encoder algorithm based on the extreme learning machine algorithm achieved a precision of 99.72%. The study proposes two algorithm models that can effectively identify drugs using near-infrared spectroscopy. This has a positive impact on the medical industry and the safety of patients' lives and health.

ALL classification using neural ensemble and memetic deep feature optimization.

Acute lymphoblastic leukemia (ALL) is a fatal blood disorder characterized by the excessive proliferation of immature white blood cells, originating in the bone marrow. An effective prognosis and treatment of ALL calls for its accurate and timely detection. Deep convolutional neural networks (CNNs) have shown promising results in digital pathology. However, they face challenges in classifying different subtypes of leukemia due to their subtle morphological differences. This study proposes an improved pipeline for binary detection and sub-type classification of ALL from blood smear images. At first, a customized, 88 layers deep CNN is proposed and trained using transfer learning along with GoogleNet CNN to create an ensemble of features. Furthermore, this study models the feature selection problem as a combinatorial optimization problem and proposes a memetic version of binary whale optimization algorithm, incorporating Differential Evolution-based local search method to enhance the exploration and exploitation of feature search space. The proposed approach is validated using publicly available standard datasets containing peripheral blood smear images of various classes of ALL. An overall best average accuracy of 99.15% is achieved for binary classification of ALL with an 85% decrease in the feature vector, together with 99% precision and 98.8% sensitivity. For B-ALL sub-type classification, the best accuracy of 98.69% is attained with 98.7% precision and 99.57% specificity. The proposed methodology shows better performance metrics as compared with several existing studies.

Improved Binary Meerkat Optimization Algorithm for efficient feature selection of supervised learning classification

Feature selection (FS) is a crucial step in machine learning and data mining projects. It aims to remove redundant and uncorrelated features, thus improving the accuracy of models. However, it can be challenging to select the optimal features, especially for datasets with many features. This paper proposes the Binary Meerkat Optimization Algorithm (BMOA) to address the issue of FS. The BMOA selects the most related and useful features. Additionally, an improved BMOA (IBMOA) is introduced, which enhances exploration and exploitation capabilities by incorporating the Periodic Mode Boundary Handling (PMBH) strategy and the Local Search (LS) process. This helps to reduce dimensionality and enhance classification accuracy. To evaluate the significance of selected features, two widely used classifiers, namely k-nearest Neighbor (k-NN) and Support Vector Machine (SVM), were used as quality raters. The proposed IBMOA and the original BMOA were compared on 21 multi-scale and multi-faceted benchmark datasets. The binary structures of eight contemporary algorithms, including Binary Artificial Bee Colony (BABC), Binary Grey Wolf Optimization (BGWO), Binary Sailfish Optimizer (BSFO), Binary Particle Swarm Optimizer (BPSO), Binary Bird Swarm Algorithm (BBSA), Binary Whale Optimization Algorithm (BWOA), Binary Grasshopper Optimization Algorithm (BGOA), and Binary Bat Algorithm (BBA), were also analyzed and compared. The proposed IBMOA algorithm outperforms competitors on small and large datasets, obtaining optimal solutions within a reasonable timeframe. This is true for the proposed IBMOA, which has been statistically proven to be highly competitive using the Wilcoxon rank sum test (with alpha=0.05).

HYBRID BINARY WHALE OPTIMIZATION ALGORITHM BASED ON TAPER SHAPED TRANSFER FUNCTION FOR SOFTWARE DEFECT PREDICTION

Reliability is one of the key factors used to gauge software quality. Software defect prediction (SDP) is one of the most important factors which affects measuring software's reliability. Additionally, the high dimensionality of the features has a direct effect on the accuracy of SDP models. The objective of this paper is to propose a hybrid binary whale optimization algorithm (BWOA) based on taper-shape transfer functions for solving feature selection problems and dimension reduction with a KNN classifier as a new software defect prediction method. In this paper, the values of a real vector that represents the individual encoding have been converted to binary vector by using the four types of Taper-shaped transfer functions to enhance the performance of BWOA to reduce the dimension of the search space. The performance of the suggested method (T-BWOA-KNN) was evaluated using eleven standard software defect prediction datasets from the PROMISE and NASA repositories depending on the K-Nearest Neighbor (KNN) classifier. Seven evaluation metrics have been used to assess the effectiveness of the suggested method. The experimental results have shown that the performance of T-BWOA-KNN produced promising results compared to other methods including ten methods from the literature, four types of T-BWOA with the KNN classifier. In addition, the obtained results are compared and analyzed with other methods from the literature in terms of the average number of selected features (SF) and accuracy rate (ACC) using the Kendall W test. In this paper, a new hybrid software defect prediction method called T-BWOA-KNN has been proposed which is concerned with the feature selection problem. The experimental results have proved that T-BWOA-KNN produced promising performance compared with other methods for most datasets.

A novel hybrid binary whale optimization algorithm with chameleon hunting mechanism for wrapper feature selection in QSAR classification model:A drug-induced liver injury case study

A novel hybrid binary whale optimization algorithm with chameleon hunting mechanism for wrapper feature selection in QSAR classification model:A drug-induced liver injury case study

A new population initialization of metaheuristic algorithms based on hybrid fuzzy rough set for high-dimensional gene data feature selection

In the realm of modern medicine and biology, vast amounts of genetic data with high complexity are available. However, dealing with such high-dimensional data poses challenges due to increased processing complexity and size. Identifying critical genes to reduce data dimensionality is essential. The filter-wrapper hybrid method is a commonly used approach in feature selection. Most of these methods employ filters such as MRMR and ReliefF, but the performance of these simple filters is limited. Rough set methods, on the other hand, are a type of filter method that outperforms traditional filters. Simultaneously, many studies have pointed out the crucial importance of good initialization strategies for the performance of the metaheuristic algorithm (a type of wrapper-based method). Combining these two points, this paper proposes a novel filter-wrapper hybrid method for high-dimensional feature selection. To be specific, we utilize the variant of bWOA (binary Whale Optimization Algorithm) based on Hybrid Fuzzy Rough Set to perform attribute reduction, and the reduced attributes are used as prior knowledge to initialize the population. We then employ metaheuristics for further feature selection based on this initialized population. We conducted experiments using five different algorithms on 14 UCI datasets. The experiment results show that after applying the initialization method proposed in this article, the performance of five enhanced algorithms, has shown significant improvement. Particularly, the improved bMFO using our initialization method: fuzzy_bMFO outperformed six currently advanced algorithms, indicating that our initialization method for metaheuristic algorithms is suitable for high-dimensional feature selection tasks.

Reliability optimization in IRS-assisted UAV networks

Unmanned aerial vehicles (UAVs) and intelligent reflecting surfaces (IRSs) are regarded as critical technologies which need to be developed for the sixth-generation mobile network (6G). In this paper, we study the reliability of the IRS-assisted Unmanned aerial vehicles (UAV) communication system with limited UAV energy in complex urban scenarios. We present the problem by joint optimization of the IRS's scheduling, the UAV's trajectory, the IRS's phase shift, and the UAV's transmit power for maximizing the reliability of the transmission link under the constraints of UAV energy and channel error rate. The concavity of the problem is difficult to judge, and the problem is hard to find a substitution function to convert it into a tractable form. Therefore, we design a chaotic adaptative hybrid whale optimization algorithm (CAHWOA) to address the problem. CAHWOA is implemented by using alternately the chaotic adaptation whale optimization algorithm (CAWOA) and the variational perturbation binary whale optimization algorithm (VPBWOA). CAWOA and VPBWOA are used for solving the continuous variable subproblem and the binary variable subproblem, respectively. The numerical results show that the joint optimization of IRS and UAV improves the transmission link reliability by nearly 30% compared with the two baseline schemes. CAHWOA can improve the convergence rate by about 18% compared with the baseline algorithms. Meanwhile, it can enhance the optimization-seeking accuracy by about 0.04.

Enhancing a convolutional neural network model for land subsidence susceptibility mapping using hybrid meta-heuristic algorithms

Managing natural hazards such as land subsidence (LS) is important because they cause large economic and human loss. LS has become a significant challenge in South Korea due to its many abandoned coal mines. Therefore, preparing LS zoning maps is vital to controlling damage caused by LS. In this study, genetic algorithm (GA) and binary whale optimization algorithm were used to select the most influential conditioning factors from the initial set of 19 factors. Subsequently, the whale optimization algorithm, and Laplacian whale optimization algorithm (LXWOA) were utilized to determine the optimal hyperparameter values for the convolutional neural network (CNN) model. The results showed that the CNN-GA-LXWOA algorithm provided a more accurate and reliable LS susceptibility map, with an area under the receiver operating characteristic curve of 0.9606, root mean square error of 0.2974 and accuracy of 91.09%. This algorithm covered 95.6% of past subsidence occurrences in the high and very high LS susceptibility classes, demonstrating its suitability for predicting future subsidence areas. We found that six main factors (elevation, drift, lineament density, slope, distance to railroads, and railroad density) control LS occurrence in Taebaek, followed by groundwater depth, lithology, and profile curvature. The proposed model may be applied for other regions with different parameters and environmental factors due to its flexible structure. The final map created in this study provides a useful tool for better LS management to mitigate the adverse effects of this natural hazard in the study area.

A Hybrid Approach for Predicting Critical Machining Conditions in Titanium Alloy Slot Milling Using Feature Selection and Binary Whale Optimization Algorithm

Monitoring the machining process is crucial for providing cost-effective, high-quality production and preventing unwanted accidents. This study aims to predict critical machining conditions related to surface roughness and tool breakage in titanium alloy slot milling. The Siemens SINUMERIK EDGE (SE) Box system collects signals from the spindle and axes of a CNC machine tool. In this study, features were extracted from signals in time, frequency, and time–frequency domains. The t-test and the binary whale optimization algorithm (BWOA) were applied to choose the best features and train the support vector machine (SVM) model with validation and training data. The SVM hyperparameters were optimized simultaneously with feature selection, and the model was tested with test data. The proposed model accurately predicted critical machining conditions for unbalanced datasets. The classification model indicates an average recall, precision, and accuracy of 80%, 86%, and 95%, respectively, when predicting workpiece quality and tool breakage.

Effective Feature Selection Strategy for Supervised Classification based on an Improved Binary Aquila Optimization Algorithm

Feature Selection (FS) is considered a crucial step in machine learning and data mining tasks, which facilitates minimizing the direct consequence of redundant and irrelevant attributes on the model’s accuracy. Hence, the researchers developed various algorithms to choose the most appropriate features for improving the accuracy rate of the presented dataset. Nevertheless, these algorithms may fall into local optima problems when applied to substantial feature sizes’ datasets. In this paper, for handling the FS strategy through dimensionality-lessening while improving the classification accuracy, an effective Aquila Optimization (AO) algorithm is introduced. AO has stable exploration and exploitation capabilities. It is enhanced by integrating a random position amendment approach with Local Search (LS) strategy to avoid local optima and then cloned into a binary version called Improved Binary AO (IBAO). Additionally, k-Nearest Neighbor (k-NN) and Support Vector Machine (SVM) are quality estimators. On 18 multi-scale benchmarks, the IBAO algorithm is compared with the original BAO algorithm and twelve recent algorithms, such as Binary Artificial Bee Colony (BABC), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO), Binary Whale Optimization Algorithm (BWOA), Binary Grey Wolf Optimization (BGWO), Binary Sailfish Optimizer (BSFO), Binary Henry Gas Solubility Optimization (BHGSO), Binary Harris Hawks Optimization (BHHO). According to Wilcoxon’s rank-sum test (α=0.05), the dominance and significant influence of IBAO are apparent on both small and large dimensional benchmarks and obtained classification accuracy up to 100% in some of these benchmarks integrated with a feature reduction size down to 92%.

TFSFB: Two-stage feature selection via fusing fuzzy multi-neighborhood rough set with binary whale optimization for imbalanced data

Obtaining informative features is crucial in imbalanced classification. However, existing neighborhood rough set-based feature selection approaches easily overlook the diversity and complexity of data distributions, and it is difficult to obtain this global optimal feature subset from imbalanced and high-dimensional datasets. To tackle these limitations, we construct a new two-stage feature subset selection scheme by fusing the fuzzy multi-neighborhood rough set (FMRS) with the binary whale optimization algorithm (BWOA) for imbalanced data. First, to evaluate those distributions of different features, this standard deviation coefficient is introduced to construct a fuzzy multi-neighborhood radius set. Then, the fuzzy multi-neighborhood granule and fuzzy membership degree are presented to establish the novel FMRS, and the feature significance measure in the view of algebra is developed to balance the approximate properties and influences of different features in the negative and positive classes. Second, fuzzy multi-neighborhood conditional entropy is defined to maximize information quantity of class- imbalanced data from the information view, and then by fusing the two evaluation perspectives above, this mixed metric is provided to fully assess this uncertainty of class-imbalanced datasets. These internal and external significant metrics are designed to obtain this preselected candidate set of features based on the filter FMRS model at this first stage. Third, a control factor can be developed to dominate the whale position update, and a novel fitness function will be constructed when fusing the dependency degree and entropy measure with the reduction ratio to evaluate this optimal subset of features. Adopting population partitioning and local interference schemes can prevent the BWOA from becoming trapped within a local optimum. To reduce this search space of evolution, the dynamic bitmask is used to improve the BWOA, and then an optimal subset of features is acquired through continuous iterations of this wrapper BWOA at this second stage. Finally, a new two-stage algorithm for feature subset selection by fusing FMRS and BWOA is provided to process class-imbalanced data, where this particle swarm optimization algorithm confirms those optimized parameters. Experiments on 31 datasets show that our algorithm is efficient and can achieve excellent classification efficiency for binary and multiclass imbalanced data.

Classification framework for faulty-software using enhanced exploratory whale optimizer-based feature selection scheme and random forest ensemble learning.

Software Fault Prediction (SFP) is an important process to detect the faulty components of the software to detect faulty classes or faulty modules early in the software development life cycle. In this paper, a machine learning framework is proposed for SFP. Initially, pre-processing and re-sampling techniques are applied to make the SFP datasets ready to be used by ML techniques. Thereafter seven classifiers are compared, namely K-Nearest Neighbors (KNN), Naive Bayes (NB), Linear Discriminant Analysis (LDA), Linear Regression (LR), Decision Tree (DT), Support Vector Machine (SVM), and Random Forest (RF). The RF classifier outperforms all other classifiers in terms of eliminating irrelevant/redundant features. The performance of RF is improved further using a dimensionality reduction method called binary whale optimization algorithm (BWOA) to eliminate the irrelevant/redundant features. Finally, the performance of BWOA is enhanced by hybridizing the exploration strategies of the grey wolf optimizer (GWO) and harris hawks optimization (HHO) algorithms. The proposed method is called SBEWOA. The SFP datasets utilized are selected from the PROMISE repository using sixteen datasets for software projects with different sizes and complexity. The comparative evaluation against nine well-established feature selection methods proves that the proposed SBEWOA is able to significantly produce competitively superior results for several instances of the evaluated dataset. The algorithms' performance is compared in terms of accuracy, the number of features, and fitness function. This is also proved by the 2-tailed P-values of the Wilcoxon signed ranks statistical test used. In conclusion, the proposed method is an efficient alternative ML method for SFP that can be used for similar problems in the software engineering domain.

Novel Optimized Feature Selection Using Metaheuristics Applied to Physical Benchmark Datasets

In data mining and machine learning, feature selection is a critical part of the process of selecting the optimal subset of features based on the target data. There are 2n potential feature subsets for every n features in a dataset, making it difficult to pick the best set of features using standard approaches. Consequently, in this research, a new metaheuristics-based feature selection technique based on an adaptive squirrel search optimization algorithm (ASSOA) has been proposed. When using metaheuristics to pick features, it is common for the selection of features to vary across runs, which can lead to instability. Because of this, we used the adaptive squirrel search to balance exploration and exploitation duties more evenly in the optimization process. For the selection of the best subset of features, we recommend using the binary ASSOA search strategy we developed before. According to the suggested approach, the number of features picked is reduced while maximizing classification accuracy. A ten-feature dataset from the University of California, Irvine (UCI) repository was used to test the proposed method’s performance vs. eleven other state-of-the-art approaches, including binary grey wolf optimization (bGWO), binary hybrid grey wolf and particle swarm optimization (bGWO-PSO), bPSO, binary stochastic fractal search (bSFS), binary whale optimization algorithm (bWOA), binary modified grey wolf optimization (bMGWO), binary multiverse optimization (bMVO), binary bowerbird optimization (bSBO), binary hybrid GWO and genetic algorithm (bGWO-GA), binary firefly algorithm (bFA), and bGA methods. Experimental results confirm the superiority and effectiveness of the proposed algorithm for solving the problem of feature selection.

Hybrid Dipper Throated and Grey Wolf Optimization for Feature Selection Applied to Life Benchmark Datasets

Selecting the most relevant subset of features from a dataset is a vital step in data mining and machine learning. Each feature in a dataset has 2n possible subsets, making it challenging to select the optimum collection of features using typical methods. As a result, a new metaheuristics-based feature selection method based on the dipper-throated and grey-wolf optimization (DTO-GW) algorithms has been developed in this research. Instability can result when the selection of features is subject to metaheuristics, which can lead to a wide range of results. Thus, we adopted hybrid optimization in our method of optimizing, which allowed us to better balance exploration and harvesting chores more equitably. We propose utilizing the binary DTO-GW search approach we previously devised for selecting the optimal subset of attributes. In the proposed method, the number of features selected is minimized, while classification accuracy is increased. To test the proposed method’s performance against eleven other state-of-the-art approaches, eight datasets from the UCI repository were used, such as binary grey wolf search (bGWO), binary hybrid grey wolf, and particle swarm optimization (bGWO-PSO), bPSO, binary stochastic fractal search (bSFS), binary whale optimization algorithm (bWOA), binary modified grey wolf optimization (bMGWO), binary multiverse optimization (bMVO), binary bowerbird optimization (bSBO), binary hysteresis optimization (bHy), and binary hysteresis optimization (bHWO). The suggested method is superior and successful in handling the problem of feature selection, according to the results of the experiments.

TSFNFS: two-stage-fuzzy-neighborhood feature selection with binary whale optimization algorithm

TSFNFS: two-stage-fuzzy-neighborhood feature selection with binary whale optimization algorithm

A Clustering Scheme Based on the Binary Whale Optimization Algorithm in FANET.

With the continuous development of Unmanned Aerial Vehicle (UAV) technology, UAVs are widely used in military and civilian fields. Multi-UAV networks are often referred to as flying ad hoc networks (FANET). Dividing multiple UAVs into clusters for management can reduce energy consumption, maximize network lifetime, and enhance network scalability to a certain extent, so UAV clustering is an important direction for UAV network applications. However, UAVs have the characteristics of limited energy resources and high mobility, which bring challenges to UAV cluster communication networking. Therefore, this paper proposes a clustering scheme for UAV clusters based on the binary whale optimization (BWOA) algorithm. First, the optimal number of clusters in the network is calculated based on the network bandwidth and node coverage constraints. Then, the cluster heads are selected based on the optimal number of clusters using the BWOA algorithm, and the clusters are divided based on the distance. Finally, the cluster maintenance strategy is set to achieve efficient maintenance of clusters. The experimental simulation results show that the scheme has better performance in terms of energy consumption and network lifetime compared with the BPSO and K-means-based schemes.

TSFNFR: Two-stage fuzzy neighborhood-based feature reduction with binary whale optimization algorithm for imbalanced data classification

Recently developed imbalanced data classification models are mainly focused on the majority class samples. In addition, several whale optimization-based feature reduction models are inefficient for high-dimensional data, readily fall into the local optimum, and are subject to difficulties associated with achieving a global optimal feature subset, due to high costs. To overcome the drawbacks, in this study, a two-stage feature reduction model using fuzzy neighborhood rough sets (FNRS) and the binary whale optimization algorithm (BWOA) was developed for imbalanced data classification. First, to indicate the sample fuzziness of mixed data, a similarity measure between samples based on fuzzy neighborhood was defined to investigate the similarity matrix and fuzzy neighborhood granule, and a new FNRS model was presented by constructing lower and upper approximations. By considering the uneven distribution of classes, the boundary-based feature significance measure was developed to minimize the influence of the uncertainty in boundary region for imbalanced data. Second, fuzzy neighborhood roughness and decision entropy were investigated based on FNRS, and by integrating these above measures, fuzzy neighborhood decision entropy was proposed to evaluate the fuzziness and roughness of the fuzzy neighborhood for imbalanced data. The external and internal significance metrics were proposed to achieve the preselected feature subset in the first stage. Third, in this second stage, a new control factor was defined to control the position of whales, and a novel fitness function was developed to evaluate the selected feature subset from imbalanced datasets. Thereafter, the immune regulation strategy of artificial immune was introduced into the BWOA to design the mixed selection probability, to divide the whale population. Two local interference strategies were applied to adjust the whale position and prevent BWOA trapped in the local optimum. Thus, an optimal feature subset was achieved by constantly iterating the BWOA. Finally, a two-stage feature reduction algorithm was designed to handle imbalanced and high-dimensional data, where the particle swarm optimization (PSO) algorithm was employed to determine the different optimized parameters for this two-stage algorithm. Experiments conducted on 22 datasets revealed that the proposed algorithm is efficient for two-class and multiclass datasets.

Improving Amphetamine-type Stimulants drug classification using chaotic-based time-varying binary whale optimization algorithm

A new chaotic time-varying binary whale optimization algorithm (CBWOATV) is introduced in this paper to optimize the feature selection process in Amphetamine-type Stimulants (ATS) and non-ATS drugs classification. Two enhancement methods were introduced in this study to provide a fit balance between exploration and exploitation in standard WOA. Firstly, a non-linear time-varying modified Sigmoid transfer function is used as the binarization method. Second, a hybrid Logistic-Tent chaotic map is employed to substitute the pseudorandom numbers of the probability operator in standard WOA. Specific high-dimensional molecular descriptors of ATS and non-ATS drugs were employed to evaluate the efficiency of the proposed algorithm. Experimental results and statistical analysis indicate that the proposed CBWOATV algorithm can prevent the problem of stagnation and entrapment in local minima in WOA. As a result, optimal descriptors were selected contributing to enhanced classification performance.

A Nascent Technique for Cultivated Feature Selection using Evolutionary Computation Algorithms

Evolutionary computation algorithms are in recent trends for feature selection due to their efficient results as compared to traditional algorithms. The performance of the evolutionary computational algorithm completely depends upon the parameter (like population, number of generations) setting. Existing parameter setting techniques have been developed for specific algorithms. This paper designs a generic pre-processing technique that removes the redundant as well as irrelevant features from the initial given feature set. This work uses Kendall tau to find the non-redundant feature and the Kruskal Wallis for the relevant features. If Kendall tau is not able to select any non-redundant feature then mutual information gain is used to select significant features followed by the Kruskal Wallis to select relevant features. The designed technique has been analyzed on 4 evolutionary computation algorithms, Modified Binary Particle Swarm Optimization, Non-dominated Sorting Genetic Algorithm, Binary Grey Wolf Optimization, and Binary Whale Optimization Algorithm over 6 datasets by using accuracy, the number of features in selected subset, sensitivity, and specificity. The present technique improves the performance of each algorithm in terms of accuracy, sensitivity, and specificity by 1 % on average with a 10 % reduction in the selected feature subset proves the significance of the proposed technique.
 HIGHLIGHTS
 
 This work removes the redundant features from the initial population using Kendall’s tau and mutual information gain to reduce the initial population for any Evolutionary Computation (EC) algorithm
 The relevant features that are highly correlated with class are added back to the initial population to maintain the optimal initial population
 The performance validation has been done using four EC algorithms to show the significance of the work
 
 GRAPHICAL ABSTRACT