Search Results (10)

Particle swarm optimization (PSO) improves classification performance and reduces computational complexity in feature selection. However, it frequently experiences from premature convergence and insufficient exploration. To address these constraints, this paper suggests an adaptive binary PSO (ABPSO) algorithm specifically designed for feature selection. First, an adaptive transfer function and two adaptive learning coefficients are introduced to achieve a better balance between exploration and exploitation during the search process. Second, a hybrid learning mechanism that integrates personal best, global best, and elite solutions is utilized to enhance population diversity. Finally, a simulated annealing (SA)–based local search strategy is employed to further refine candidate solutions and improve convergence behavior. Experimental results demonstrate that ABPSO outperforms binary PSO (BPSO), harris hawks optimization (HHO), whale optimization algorithm (WOA), and ant colony optimization (ACO) in classification accuracy. In particular, ABPSO achieves the lowest classification error rates on the Dermatology (0.0106), Ionosphere (0.0705), Lung (0.1521), Sonar (0.0996), Spambase (0.0758), Statlog (0.1446), and Wine (0.0280) datasets. Full article

Aiming to address the problems of uneven brightness and small defects of low contrast on the surface of lithium battery electrode (LBE) coatings, this study proposes a method for detection and identification of coatings defects in LBEs based on an improved Binary Tree Support Vector Machine (BT-SVM). Firstly, adaptive Gamma correction is applied to enhance an image, and an improved Canny algorithm combined with morphological processing is used to accurately detect the defect regions. Secondly, the shape and grayscale features of the defects are extracted from the connected defect areas, and these features are then fused and normalized. Finally, a BT-SVM multi-class classification model is constructed, with the Whale Optimization Algorithm (WOA) employed to assist in hyperparameter tuning. The experimental results show that the proposed method can effectively detect and identify five common types of defects in the coating of LBEs, including scratches, bubbles, metal leakage, particles, and decarbonization, with an average detection accuracy of 94.4% and an average detection time of less than 0.2 s, meeting the real-time detection requirements for online defect inspection. After Whale Optimization, the BT-SVM defect recognition model achieves an average recognition accuracy of 98.7%, significantly enhancing the performance of current defect detection technologies for LBE coatings. Full article

Feature selection (FS) is a classic and challenging optimization task in most machine learning and data mining projects. Recently, researchers have attempted to develop more effective methods by using metaheuristic methods in FS. To increase population diversity and further improve the effectiveness of the beluga whale optimization (BWO) algorithm, in this paper, we propose a multi-strategies improved BWO (MSBWO), which incorporates improved circle mapping and dynamic opposition-based learning (ICMDOBL) population initialization as well as elite pool (EP), step-adaptive Lévy flight and spiral updating position (SLFSUP), and golden sine algorithm (Gold-SA) strategies. Among them, ICMDOBL contributes to increasing the diversity during the search process and reducing the risk of falling into local optima. The EP technique also enhances the algorithm′s ability to escape from local optima. The SLFSUP, which is distinguished from the original BWO, aims to increase the rigor and accuracy of the development of local spaces. Gold-SA is introduced to improve the quality of the solutions. The hybrid performance of MSBWO was evaluated comprehensively on IEEE CEC2005 test functions, including a qualitative analysis and comparisons with other conventional methods as well as state-of-the-art (SOTA) metaheuristic approaches that were introduced in 2024. The results demonstrate that MSBWO is superior to other algorithms in terms of accuracy and maintains a better balance between exploration and exploitation. Moreover, according to the proposed continuous MSBWO, the binary MSBWO variant (BMSBWO) and other binary optimizers obtained by the mapping function were evaluated on ten UCI datasets with a random forest (RF) classifier. Consequently, BMSBWO has proven very competitive in terms of classification precision and feature reduction. Full article

Multimodal data fusion (electroencephalography (EEG) and functional near-infrared spectroscopy (fNIRS)) has been developed as an important neuroimaging research field in order to circumvent the inherent limitations of individual modalities by combining complementary information from other modalities. This study employed an optimization-based feature selection algorithm to systematically investigate the complementary nature of multimodal fused features. After preprocessing the acquired data of both modalities (i.e., EEG and fNIRS), the temporal statistical features were computed separately with a 10 s interval for each modality. The computed features were fused to create a training vector. A wrapper-based binary enhanced whale optimization algorithm (E-WOA) was used to select the optimal/efficient fused feature subset using the support-vector-machine-based cost function. An online dataset of 29 healthy individuals was used to evaluate the performance of the proposed methodology. The findings suggest that the proposed approach enhances the classification performance by evaluating the degree of complementarity between characteristics and selecting the most efficient fused subset. The binary E-WOA feature selection approach showed a high classification rate (94.22 ± 5.39%). The classification performance exhibited a 3.85% increase compared with the conventional whale optimization algorithm. The proposed hybrid classification framework outperformed both the individual modalities and traditional feature selection classification (p < 0.01). These findings indicate the potential efficacy of the proposed framework for several neuroclinical applications. Full article

Biomass is a renewable energy source because it is contained in organic material such as plants. This paper introduces a modified hunger games search for solving global optimization and biomass distributed generator problems. The hunger search algorithm is a very recent optimization algorithm. Despite its merits, it still needs some modifications. The proposed approach includes a new binary τ-based crossover strategy with satisfaction fulfillment step mechanisms. This new algorithm is designed to improve the original hunger games search algorithm by addressing some of its shortcomings, specifically, in solving problems related to global optimization such as finding the best possible solutions for biomass distributed generators. To assess the power of the new approach, its performance was evaluated on the IEEE CEC’2020 test suite against five recent and competitive algorithms. This comparison process included applying the Wilcoxon sign rank and Friedman statistical tests. Reducing the system losses and enhancing the network’s voltage profile are two main issues in the stability of radial distribution networks. Optimal allocation of biomass distributed generators in radial distribution networks can not only improve their stability but also guarantee good service to the customers. Consequently, this research work suggests an effective strategy based on the proposed approach to produce the optimal positions, sizes, and power factors of the biomass distributed generators in the network. Accordingly, the target is to mitigate the network’s active power loss such that the power flow and the bus voltage have to be maintained at their standard limits. Three distribution networks were considered for validating the superiority of the new proposed algorithm. These networks are the IEEE 33-bus, IEEE 69-bus, and IEEE 119-bus. The obtained results were compared with the gravitational search algorithm, whale optimization algorithm, grey wolf optimizer, Runge Kutta method, and the original hunger search algorithm. The new approach outperformed the other considered approaches in obtaining the optimal parameters, which mitigated the power loss to 11.6300, 5.2291, and 145.489 kW, with loss reduction of 94.49%, 97.68%, and 88.79% for the three networks, respectively. Full article

Aiming at the poor effect of traditional denoising algorithms on image enhancement with strong noise, an image denoising algorithm based on improved whale optimization algorithm and parameter adaptive array stochastic resonance is proposed in the paper. In this algorithm, through dimensionality reduction scanning, coding, modulation and other processing, the noise-containing gray image becomes a one-dimensional aperiodic binary pulse amplitude modulation signal suitable for a bistable stochastic resonance model. Then, the traditional whale optimization algorithm is improved in the initial solution distribution, global search ability and population diversity generalization. The improved whale optimization algorithm is applied to select the parameters of the stochastic resonance, which effectively improves the parameters self-adaptive of the array stochastic resonance model. Finally, the denoised image is obtained by demodulating, decoding and anti-scanning the stochastic resonance output. The experimental results show that compared with the array stochastic resonance method with fixed parameters and the classical image denoising method, the algorithm proposed in this paper has better performance in terms of visual effect and peak signal-to-noise ratio index, which proves the advantages and effective application of the method in image denoising. Full article

Feature selection is a very important direction for network intrusion detection. However, current feature selection technology of network intrusion detection has the problems of low detection rate and low accuracy due to feature redundancy. An improved Butterfly Optimization Algorithm combined with Black Widow Optimization (BWO-BOA) is proposed in this paper, which introduces a dynamic adaptive search strategy in the global search phase of the Butterfly Optimization Algorithm (BOA), uses the movement search process of Black Widow Optimization (BWO) algorithm as the local search, and at the same time, in order to overcome the improved butterfly optimization algorithm easily falling into a local optimum in local search phase, takes advantage of the small probability mutation strategy to filter out the redundant features. This paper then tries to apply the proposed BWO-BOA algorithm to feature selection of network intrusion detection. In order to verify the performance of the proposed BWO-BOA algorithm, the UNSW-NB15 dataset is selected for binary classification and multi-classification simulation experiments, and the feature selection models of BWO-BOA algorithm, BOA algorithm, BWO algorithm, Particle Swarm Optimization, Salp Swarm Algorithm, Whale Optimization Algorithm and improved Butterfly Optimization Algorithm are compared for validation. The experimental results show that the proposed BWO-BOA algorithm can enhance the performance of the feature selection model in network intrusion detection and significantly boost the reduction of feature dimensions. Full article

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. Full article

The students’ performance prediction (SPP) problem is a challenging problem that managers face at any institution. Collecting educational quantitative and qualitative data from many resources such as exam centers, virtual courses, e-learning educational systems, and other resources is not a simple task. Even after collecting data, we might face imbalanced data, missing data, biased data, and different data types such as strings, numbers, and letters. One of the most common challenges in this area is the large number of attributes (features). Determining the highly valuable features is needed to improve the overall students’ performance. This paper proposes an evolutionary-based SPP model utilizing an enhanced form of the Whale Optimization Algorithm (EWOA) as a wrapper feature selection to keep the most informative features and enhance the prediction quality. The proposed EWOA combines the Whale Optimization Algorithm (WOA) with Sine Cosine Algorithm (SCA) and Logistic Chaotic Map (LCM) to improve the overall performance of WOA. The SCA will empower the exploitation process inside WOA and minimize the probability of being stuck in local optima. The main idea is to enhance the worst half of the population in WOA using SCA. Besides, LCM strategy is employed to control the population diversity and improve the exploration process. As such, we handled the imbalanced data using the Adaptive Synthetic (ADASYN) sampling technique and converting WOA to binary variant employing transfer functions (TFs) that belong to different families (S-shaped and V-shaped). Two real educational datasets are used, and five different classifiers are employed: the Decision Trees (DT), k-Nearest Neighbors (k-NN), Naive Bayes (NB), Linear Discriminant Analysis (LDA), and LogitBoost (LB). The obtained results show that the LDA classifier is the most reliable classifier with both datasets. In addition, the proposed EWOA outperforms other methods in the literature as wrapper feature selection with selected transfer functions. Full article

Feature selection (FS) was regarded as a global combinatorial optimization problem. FS is used to simplify and enhance the quality of high-dimensional datasets by selecting prominent features and removing irrelevant and redundant data to provide good classification results. FS aims to reduce the dimensionality and improve the classification accuracy that is generally utilized with great importance in different fields such as pattern classification, data analysis, and data mining applications. The main problem is to find the best subset that contains the representative information of all the data. In order to overcome this problem, two binary variants of the whale optimization algorithm (WOA) are proposed, called bWOA-S and bWOA-V. They are used to decrease the complexity and increase the performance of a system by selecting significant features for classification purposes. The first bWOA-S version uses the Sigmoid transfer function to convert WOA values to binary ones, whereas the second bWOA-V version uses a hyperbolic tangent transfer function. Furthermore, the two binary variants introduced here were compared with three famous and well-known optimization algorithms in this domain, such as Particle Swarm Optimizer (PSO), three variants of binary ant lion (bALO1, bALO2, and bALO3), binary Dragonfly Algorithm (bDA) as well as the original WOA, over 24 benchmark datasets from the UCI repository. Eventually, a non-parametric test called Wilcoxon’s rank-sum was carried out at 5% significance to prove the powerfulness and effectiveness of the two proposed algorithms when compared with other algorithms statistically. The qualitative and quantitative results showed that the two introduced variants in the FS domain are able to minimize the selected feature number as well as maximize the accuracy of the classification within an appropriate time. Full article