Hybrid whale algorithm with evolutionary strategies and filtering for high-dimensional optimization: Application to microarray cancer data
Ontology highlight
ABSTRACT:
SUBMITTER: Hafiz R
PROVIDER: S-EPMC10927076 | biostudies-literature | 2024 Jan
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:A microarray is a revolutionary tool that generates vast volumes of data that describe the expression profiles of genes under investigation that can be qualified as Big Data. Hadoop and Spark are efficient frameworks, developed to store and analyze Big Data. Analyzing microarray data helps researchers to identify correlated genes. Clustering has been successfully applied to analyze microarray data by grouping genes with similar expression profiles into clusters. The complex nature of microarray data obligated clustering methods to employ multiple evaluation functions to ensure obtaining solutions with high quality. This transformed the clustering problem into a Multi-Objective Problem (MOP). A new and efficient hybrid Multi-Objective Whale Optimization Algorithm with Tabu Search (MOWOATS) was proposed to solve MOPs. In this article, MOWOATS is proposed to analyze massive microarray datasets. Three evaluation functions have been developed to ensure an effective assessment of solutions. MOWOATS has been adapted to run in parallel using Spark over Hadoop computing clusters. The quality of the generated solutions was evaluated based on different indices, such as Silhouette and Davies-Bouldin indices. The obtained clusters were very similar to the original classes. Regarding the scalability, the running time was inversely proportional to the number of computing nodes.
| S-EPMC8022636 | biostudies-literature
Project description:The Whale Optimization Algorithm (WOA) is regarded as a classic metaheuristic algorithm, yet it suffers from limited population diversity, imbalance between exploitation and exploration, and low solution accuracy. In this paper, we propose the Spiral-Enhanced Whale Optimization Algorithm (SEWOA), which incorporates a nonlinear time-varying self-adaptive perturbation strategy and an Archimedean spiral structure into the original WOA. The Archimedean spiral structure enhances the diversity of the solution space, aiding the algorithm in escaping local optima. The nonlinear time-varying self-adaptive optimization dynamic perturbation strategy improves the algorithm's local search capability and enhances solution accuracy. The effectiveness of the proposed algorithm is validated from multiple perspectives using CEC2014 test functions, CEC2017 test functions, and 23 benchmark test functions. The experimental results demonstrate that the enhanced Whale Optimization Algorithm significantly improves population diversity, balances global and local search, and enhances solution accuracy. Additionally, SEWOA exhibits excellent performance in solving three engineering design problems, showcasing its value and wide range of potential applications.
| S-EPMC11489690 | biostudies-literature
Project description:The wireless sensor network (WSN) is an essential technology of the Internet of Things (IoT) but has the problem of low coverage due to the uneven distribution of sensor nodes. This paper proposes a novel enhanced whale optimization algorithm (WOA), incorporating Lévy flight and a genetic algorithm optimization mechanism (WOA-LFGA). The Lévy flight technique bolsters the global search ability and convergence speed of the WOA, while the genetic optimization mechanism enhances its local search and random search capabilities. WOA-LFGA is tested with 29 mathematical optimization problems and a WSN coverage optimization model. Simulation results demonstrate that the improved algorithm is highly competitive compared with mainstream algorithms. Moreover, the practicality and the effectiveness of the improved algorithm in optimizing wireless sensor network coverage are confirmed.
| S-EPMC10452118 | biostudies-literature
Project description:In biomedical data mining, the gene dimension is often much larger than the sample size. To solve this problem, we need to use a feature selection algorithm to select feature gene subsets with a strong correlation with phenotype to ensure the accuracy of subsequent analysis. This paper presents a new three-stage hybrid feature gene selection method, that combines a variance filter, extremely randomized tree, and whale optimization algorithm. First, a variance filter is used to reduce the dimension of the feature gene space, and an extremely randomized tree is used to further reduce the feature gene set. Finally, the whale optimization algorithm is used to select the optimal feature gene subset. We evaluate the proposed method with three different classifiers in seven published gene expression profile datasets and compare it with other advanced feature selection algorithms. The results show that the proposed method has significant advantages in a variety of evaluation indicators.
| S-EPMC9992521 | biostudies-literature
Project description:This work considers the Bi-objective Traveling Salesman Problem (BTSP), where two conflicting objectives, the travel time and monetary cost between cities, are minimized. Our purpose is to compute the trade-off solutions that fulfill the problem requirements. We introduce a novel three-Phase Hybrid Evolutionary Algorithm (3PHEA) based on the Lin-Kernighan Heuristic, an improved version of the Non-Dominated Sorting Genetic Algorithm, and Pareto Variable Neighborhood Search, a multi-objective version of VNS. We conduct a comparative study with three existing approaches dedicated to solving BTSP. To assess the performance of algorithms, we consider 20 BTSP instances from the literature of varying degrees of difficulty (e.g., euclidean, random, mixed, etc.) and different sizes ranging from 100 to 1000 cities. We also compute several multi-objective performance indicators, including running time, coverage, hypervolume, epsilon, generational distance, inverted generational distance, spread, and generalized spread. Experimental results and comparative analysis indicate that the proposed three-phase method 3PHEA is significantly superior to existing approaches covering up to 80% of the true Pareto fronts.
| S-EPMC10017715 | biostudies-literature
Project description:To balance the convergence speed and solution diversity and enhance optimization performance when addressing large-scale optimization problems, this research study presents an improved ant colony optimization (ICMPACO) technique. Its foundations include the co-evolution mechanism, the multi-population strategy, the pheromone diffusion mechanism, and the pheromone updating method. The suggested ICMPACO approach separates the ant population into elite and common categories and breaks the optimization problem into several sub-problems to boost the convergence rate and prevent slipping into the local optimum value. To increase optimization capacity, the pheromone update approach is applied. Ants emit pheromone at a certain spot, and that pheromone progressively spreads to a variety of nearby regions thanks to the pheromone diffusion process. Here, the real gate assignment issue and the travelling salesman problem (TSP) are chosen for the validation of the performance for the optimization of the ICMPACO algorithm. The experiment's findings demonstrate that the suggested ICMPACO method can successfully solve the gate assignment issue, find the optimal optimization value in resolving TSP, provide a better assignment outcome, and exhibit improved optimization ability and stability. The assigned efficiency is comparatively higher than earlier ones. With an assigned efficiency of 83.5 %, it can swiftly arrive at the ideal gate assignment outcome by assigning 132 patients to 20 gates of hospital testing rooms. To minimize the patient's overall hospital processing time, this algorithm was specifically employed with a better level of efficiency to create appropriate scheduling in the hospital.
| S-EPMC11693920 | biostudies-literature
Project description:In the field of asset allocation, how to balance the returns of an investment portfolio and its fluctuations is the core issue. Capital asset pricing model, arbitrage pricing theory, and Fama-French three-factor model were used to quantify the price of individual stocks and portfolios. Based on the second-order stochastic dominance rule, the higher moments of return series, the Shannon entropy, and some other actual investment constraints, we construct a multiconstraint portfolio optimization model, aiming at comprehensively weighting the returns and risk of portfolios rather than blindly maximizing its returns. Furthermore, the whale optimization algorithm based on FTSE100 index data is used to optimize the above multiconstraint portfolio optimization model, which significantly improves the rate of return of the simple diversified buy-and-hold strategy or the FTSE100 index. Furthermore, extensive experiments validate the superiority of the whale optimization algorithm over the other four swarm intelligence optimization algorithms (gray wolf optimizer, fruit fly optimization algorithm, particle swarm optimization, and firefly algorithm) through various indicators of the results, especially under harsh constraints.
| S-EPMC7474746 | biostudies-literature
Project description:The rapid development of the internet has brought about a comprehensive transformation in human life. However, the challenges of cybersecurity are becoming increasingly severe, necessitating the implementation of effective security mechanisms. Cybersecurity situational awareness can effectively assess the network status, facilitating the formulation of better cybersecurity defense strategies. However, due to the low accuracy of existing situational assessment methods, situational assessment remains a challenge. In this study, a new situational assessment method, MSWOA-BiGRU, combining optimization algorithms and temporal neural networks, was proposed. Firstly, a scientific indicator system proposed in this research is used to calculate the values of each indicator. Then, the Analytic Hierarchy Process is used to derive the actual situation values, which serve as labels. Taking into account the temporal nature of network traffic, the BiGRU model is utilized for cybersecurity situational assessment. After integrating time-related features and network traffic characteristics, the situational assessment value is obtained. During the evaluation process, a whale optimization algorithm (MSWOA) improved with a mix of strategies proposed in this study was employed to optimize the model. The performance of the proposed MSWOA-BiGRU model was evaluated on publicly available real network security datasets. Experimental results indicate that compared to traditional optimization algorithms, the optimization performance of MSWOA has seen significant enhancement. Furthermore, MSWOA-BiGRU demonstrates superior performance in cybersecurity situational assessment compared to existing evaluation methods.
| S-EPMC10773833 | biostudies-literature
Project description:The sustainability of artificial sand-binding vegetation is determined by the water balance between evapotranspiration (ET) and precipitation in desert regions. Consequently, accurately estimating ET is a critical prerequisite for determing the types and spatial distribution of artificial vegetation in different sandy areas. For this purpose, a novel hybrid estimation model was proposed to estimate monthly ET by coupling the deep learning long short term memory (LSTM) with variational mode decomposition (VMD) and whale optimization algorithm (WOA) (i.e., VMD-WOA-LSTM) to estimate the monthly ET in the southeast margins of Tengger Desert. The superiority of LSTM was selected due to its capability of automatically extracting the nonlinear and nonstationary features from sequential data, WOA was employed to optimize the hyperparameters of LSTM, and VMD was used to extract the intrinsic traits of ET time series. The estimating results of VMD-WOA-LSTM has been compared with actual ET and estimation of other hybrid models in terms of standard performance metrics. The results reveale that VMD-WOA-LSTM provide more accurate and reliable estimating results than that of LSTM, the support vector machine (SVM), and the variants of those models. Therefore, VMD-WOA-LSTM could be recommended as an essential auxiliary method to estimate ET in desert regions.
| S-EPMC9715655 | biostudies-literature
Project description:Quantum genetic algorithms (QGA) integrate genetic programming and quantum computing to address search and optimization problems. The standard strategy of the hybrid QGA approach is to add quantum resources to classical genetic algorithms (GA), thus improving their efficacy (i.e., quantum optimization of a classical algorithm). However, the extent of such improvements is still unclear. Conversely, Reduced Quantum Genetic Algorithm (RQGA) is a fully quantum algorithm that reduces the GA search for the best fitness in a population of potential solutions to running Grover's algorithm. Unfortunately, RQGA finds the best fitness value and its corresponding chromosome (i.e., the solution or one of the solutions of the problem) in exponential runtime, O(2n/2), where n is the number of qubits in the individuals' quantum register. This article introduces a novel QGA optimization strategy, namely a classical optimization of a fully quantum algorithm, to address the RQGA complexity problem. Accordingly, we control the complexity of the RQGA algorithm by selecting a limited number of qubits in the individuals' register and fixing the remaining ones as classical values of '0' and '1' with a genetic algorithm. We also improve the performance of RQGA by discarding unfit solutions and bounding the search only in the area of valid individuals. As a result, our Hybrid Quantum Algorithm with Genetic Optimization (HQAGO) solves search problems in O(2(n-k)/2) oracle queries, where k is the number of fixed classical bits in the individuals' register.
| S-EPMC11639129 | biostudies-literature