Search

Intrusion detection systems (IDS) play a crucial role in securing networks and identifying malicious activity. This is a critical problem in cyber security. In recent years, metaheuristic optimization algorithms and deep learning techniques have been applied to IDS to improve their accuracy and efficiency. Generally, optimization algorithms can be used to boost the performance of IDS models. Deep learning methods, such as convolutional neural networks, have also been used to improve the ability of IDS to detect and classify intrusions. In this paper, we propose a new IDS model based on the combination of deep learning and optimization methods. First, a feature extraction method based on CNNs is developed. Then, a new feature selection method is used based on a modified version of Growth Optimizer (GO), called MGO. We use the Whale Optimization Algorithm (WOA) to boost the search process of the GO. Extensive evaluation and comparisons have been conducted to assess the quality of the suggested method using public datasets of cloud and Internet of Things (IoT) environments. The applied techniques have shown promising results in identifying previously unknown attacks with high accuracy rates. The MGO performed better than several previous methods in all experimental comparisons. [ABSTRACT FROM AUTHOR]

Determining the most relevant features is a critical pre-processing step in various fields to enhance prediction. To address this issue, a set of feature selection (FS) techniques have been proposed; however, they still have certain limitations. For example, they may focus on nearby points, which lowers classification accuracy because the chosen features may include noisy features. To take advantage of the benefits of the quantum-based optimization technique and the 2D chaotic Hénon map, we provide a modified version of the honey badger algorithm (HBA) called QCHBA. The ability of such strategies to strike a balance between exploitation and exploration while identifying the workable subset of pertinent features is the basis for employing them to enhance HBA. The effectiveness of QCHBA was evaluated in a series of experiments conducted using eighteen datasets involving comparison with recognized FS techniques. The results indicate high efficiency of the QCHBA among the datasets using various performance criteria. [ABSTRACT FROM AUTHOR]

Recently, the 6G-enabled Internet of Medical Things (IoMT) has played a key role in the development of functional health systems due to the massive data generated daily from the hospitals. Therefore, the automatic detection and prediction of future risks such as pneumonia and retinal diseases are still under research and study. However, traditional approaches did not yield good results for accurate diagnosis. In this paper, a robust 6G-enabled IoMT framework is proposed for medical image classification with an ensemble learning (EL)-based model. EL is achieved using MobileNet and DenseNet architecture as a feature extraction backbone. In addition, the developed framework uses a modified honey badger algorithm (HBA) based on Levy flight (LFHBA) as a feature selection method that aims to remove the irrelevant features from those extracted features using the EL model. For evaluation of the performance of the proposed framework, the chest X-ray (CXR) dataset and the optical coherence tomography (OCT) dataset were employed. The accuracy of our technique was 87.10% on the CXR dataset and 94.32% on OCT dataset—both very good results. Compared to other current methods, the proposed method is more accurate and efficient than other well-known and popular algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a machine learning model to predict the effect of Al2O3 nanoparticle content on the coefficient of thermal expansion in Cu-Al2O3 nanocomposites prepared using an in situ chemical technique. The model developed is a modification of Long Short-Term Memory (LSTM) using dwarf mongoose optimization (DMO), which mimics the behavior of DMO to find its food for predicting the behavior of the composite. The swarm of DMO consists of three groups, namely the alpha group, scouts, and babysitters. Each group has its own behavior to capture the food. The preparation of the nanocomposite was performed using aluminum nitrate that was added to a solution containing scattered copper nitrate. After that, the powders of CuO and Al2O3 were obtained, and the leftover liquid was removed using thermal treatment at 850 °C for 1 h. The powders were consolidated using compaction and sintering processes. The impact of Al2O3 contents on the thermal properties of the Cu-Al2O3 nanocomposite was investigated. The results showed that the Thermal Expansion Coefficient (TEC) decreases with increasing Al2O3 content due to the increased precipitation of Al2O3 nanoparticles at the grain boundaries of the Cu matrix. Moreover, the good interfacial bonding between Al2O3 and the Cu may participate in this decrease in TEC. The proposed machine learning model was able to predict the TEC of all the produced composites with different Al2O3 content and was tested at different temperatures with very good accuracy, reaching 99%. [ABSTRACT FROM AUTHOR]

Feature selection (FS) is a necessary process applied to reduce the high dimensionality of the dataset. It is utilized to obtain the most relevant information and reduce the computational efforts of the classification process. Recently, metaheuristics methods have been widely employed for various optimization problems, including FS. In the current study, we present an FS method based on a new modified version of the marine predators algorithm (MPA). In the developed MPASCA model, the sine–cosine algorithm (SCA) is utilized to improve the search ability, which works as a local search of the MPA. To evaluate the performance of the MPASCA algorithm, extensive experiments were carried out using 18 UCI datasets. More so, the metabolomics dataset is used to test the proposed method as a real-world application. Furthermore, we implemented extensive comparisons to several state-of-art methods to verify the efficiency of the MPASCA. The evaluation outcomes showed that the MPASCA has significant performance, and it outperforms the compared methods in terms of classification measures. [ABSTRACT FROM AUTHOR]

• Developing a new paradigm for the feature selection problem based on the hyperheuristic methodology. • Configuring the combination of the components in to automatically find the most pertinent features for each dataset. • Evaluating the performance of the proposed technique using a comprehensive set of eighteen datasets. • Comparing the results of the best FS combination with the other well-known FS methods. Feature selection (FS) is a crucial step for effective data mining since it has largest effect on improving the performance of classifiers. This is achieved by removing the irrelevant features and using only the relevant features. Many metaheuristic approaches exist in the literature in attempt to address this problem. The performance of these approaches differ based on the settings of a number of factors including the use of chaotic maps, opposition-based learning (OBL) and the percentage of the population that OBL will be applied to, the metaheuristic (MH) algorithm adopted, the classifier utilized, and the threshold value used to convert real solutions to binary ones. However, it is not an easy task to identify the best settings for these different components in order to determine the relevant features for a specific dataset. Moreover, running extensive experiments to fine tune these settings for each and every dataset will consume considerable time. In order to mitigate this important issue, a hyper-heuristic based FS paradigm is proposed. In the proposed model, a two-stage approach is adopted to identify the best combination of these components. In the first stage, referred to as the training stage , the Differential Evolution (DE) algorithm is used as a controller for selecting the best combination of components to be used by the second stage. In the second stage, referred to as the testing stage , the received combination will be evaluated using a testing set. Empirical evaluation of the proposed framework is based on numerous experiments performed on the most popular 18 datasets from the UCI machine learning repository. Experimental results illustrates that the generated generic configuration provides a better performance than eight other metaheuristic algorithms over all performance measures when applied to the UCI dataset. Moreover, The overall paradigm ranks at number one when compared against state-of-the-art algorithms. Finally, the generic configuration provides a very competitive performance for high dimensional datasets. [ABSTRACT FROM AUTHOR]

Unrelated parallel machine scheduling problem (UPMSP) with sequence-dependent setup times is considered a hot topic among the researchers, as it presents more complexity to be able to find an optimal solution. Many efforts have been made to solve UPMSP problems and established their performances. Therefore, in this study, a new method is introduced to address UPMSP problems with sequence-dependent and machine-dependent setup time. Our proposed method utilizes two meta-heuristic techniques, the whale optimization algorithm (WOA) and the firefly algorithm (FA), by combining their features to perform this task. The hybrid model is called WOAFA. For more detail, the operators of the FA are employed to improve the exploitation ability of the WOA by serving as a local search. Moreover, the quality of the proposed WOAFA method is tested by comparing with well-known meta-heuristic algorithms over six machines and six jobs, namely (2, 4, 6, 8, 10, and 12 machines) and (20, 40, 60, 80, 100, and 120 jobs). [ABSTRACT FROM AUTHOR]

Multilevel thresholding image segmentation has received considerable attention in several image processing applications. However, the process of determining the optimal threshold values (as the preprocessing step) is time-consuming when traditional methods are used. Although these limitations can be addressed by applying metaheuristic methods, such approaches may be idle with a local solution. This study proposed an alternative multilevel thresholding image segmentation method called VPLWOA, which is an improved version of the volleyball premier league (VPL) algorithm using the whale optimization algorithm (WOA). In VPLWOA, the WOA is used as a local search system to improve the learning phase of the VPL algorithm. A set of experimental series is performed using two different image datasets to assess the performance of the VPLWOA in determining the values that may be optimal threshold, and the performance of this algorithm is compared with other approaches. Experimental results show that the proposed VPLWOA outperforms the other approaches in terms of several performance measures, such as signal-to-noise ratio and structural similarity index. [ABSTRACT FROM AUTHOR]

Recently, significant attention has been devoted to vaccine-derived poliovirus (VDPV) surveillance due to its severe consequences. Prediction of the outbreak incidence of VDPF requires an accurate analysis of the alarming data. The overarching aim to this study is to develop a novel hybrid machine learning approach to identify the key parameters that dominate the outbreak incidence of VDPV. The proposed method is based on the integration of random vector functional link (RVFL) networks with a robust optimization algorithm called whale optimization algorithm (WOA). WOA is applied to improve the accuracy of the RVFL network by finding the suitable parameter configurations for the algorithm. The classification performance of the WOA-RVFL method is successfully validated using a number of datasets from the UCI machine learning repository. Thereafter, the method is implemented to track the VDPV outbreak incidences recently occurred in several provinces in Lao People's Democratic Republic. The results demonstrate the accuracy and efficiency of the WOA-RVFL algorithm in detecting the VDPV outbreak incidences, as well as its superior performance to the traditional RVFL method. [ABSTRACT FROM AUTHOR]

This paper proposes an improved version of the grasshopper optimization algorithm (GOA) based on the opposition-based learning (OBL) strategy called OBLGOA for solving benchmark optimization functions and engineering problems. The proposed OBLGOA algorithm consists of two stages: the first stage generates an initial population and its opposite using the OBL strategy; and the second stage uses the OBL as an additional phase to update the GOA population in each iteration. However, the OBL is applied to only half of the solutions to reduce the time complexity. To investigate the performance of the proposed OBLGOA, six sets of experiment series are performed, and they include twenty-three benchmark functions and four engineering problems. The experiments revealed that the results of the proposed algorithm were superior to those of ten well-known algorithms in this domain. Eventually, the obtained results proved that the OBLGOA algorithm can provide competitive results for optimization engineering problems compared with state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Solar cells are considered as a clean source of energy, and their application includes industrial and domestic users. Most of the algorithms used to design solar cells are tested (and used) only for domestic implementations. However, it is necessary to have accurate mechanisms for solar cell design that can be used in both industrial and domestic energy systems. To achieve this goal, this article introduces an improved version of the whale optimization Algorithm that uses the opposition-based learning to enhance the exploration of the search space. This algorithm is applied to estimate the parameters of solar cells using three different diode models. Such models are the single diode model, the double diode model and the three diode model, each of them has different internal parameters that must be accurately estimated in order to have a good performance of the solar cells. The inclusion of the three diode model is due it represents a more accurate representation of the solar cells behavior in industrial applications. For experiments and comparisons, there are used similar approaches and datasets from solar cells and photovoltaic modules. Moreover, the proposed method has also been tested over different benchmark optimization functions to verify its exploration capabilities. The experiments and comparisons support the performance of the proposed approach in complex optimization problems. [ABSTRACT FROM AUTHOR]

This survey is an effort to provide a research repository and a useful reference for researchers to guide them when planning to develop new Nature-inspired Algorithms tailored to solve Feature Selection problems (NIAs-FS). We identified and performed a thorough literature review in three main streams of research lines: Feature selection problem, optimization algorithms, particularly, meta-heuristic algorithms, and modifications applied to NIAs to tackle the FS problem. We provide a detailed overview of 156 different articles about NIAs modifications for tackling FS. We support our discussions by analytical views, visualized statistics, applied examples, open-source software systems, and discuss open issues related to FS and NIAs. Finally, the survey summarizes the main foundations of NIAs-FS with approximately 34 different operators investigated. The most popular operator is chaotic maps. Hybridization is the most widely used modification technique. There are three types of hybridization: Integrating NIA with another NIA, integrating NIA with a classifier, and integrating NIA with a classifier. The most widely used hybridization is the one that integrates a classifier with the NIA. Microarray and medical applications are the dominated applications where most of the NIA-FS are modified and used. Despite the popularity of the NIAs-FS, there are still many areas that need further investigation. [ABSTRACT FROM AUTHOR]

The topological structure of the search agents in the swarm is a key factor in diversifying the knowledge between the population and balancing the designs of the exploration and intensification stages. Marine Predator Algorithm (MPA) is a recently introduced algorithm that mimics the interaction between the prey and predator in ocean. MPA has a vital issue in its structure. This drawback related to the number of iterations that is divided into the algorithm phases, hence the agents do not have the adequate number of tries to discover the search landscape and exploit the optimal solutions. This situation affects the search process. Therefore, in this paper, the principle of the comprehensive learning strategy and memory perspective of the fractional calculus have been incorporated into MPA. They help to achieve an efficient sharing for the best knowledge and the historical experiences between the agents with the aim of escaping from the local solutions and avoiding the immature convergence. The developed fractional-order comprehensive learning MPA (FOCLMPA) has been examined with several multidimensional benchmarks from the CEC2017 and CEC2020 as challenging tested functions in the numerical validation part. For real-world applications, four engineering problems have been employed and a set of eighteen UCI datasets have been used to demonstrate the developed performance for feature selection optimization problem. The FOCLMPA has been compared with several well-regarded optimization algorithms via numerous statistical and non-parametric analyses to provide unbiased recommendation. The comparisons confirm the superiority and stability of FOCLMPA in handling the series of experiments with high qualified results and remarkable convergence curves. [ABSTRACT FROM AUTHOR]

• Enhance EO algorithm using ReliefF algorithm and the local search strategy. • Propose new feature selection method based on a hybridization RBEO-LS method. • Evaluate RBEO-LS using 16 UCI datasets and 10 high dimensional biological datasets. • Results show superiority of RBEO-LS among other state-of-the-art methods. Feature selection (FS) is an important task in any classification process and aims to choose the smallest features number that yields higher classification accuracy. FS can be formulated as a combinatorial NP-hard problem for which robust metaheuristics are used as efficient wrapper-based FS approaches. However, when applied for high dimensional datasets that present large features number and few samples, the effectiveness of such wrapper-metaheuristics degraded, and their computation costs increased. To tackle this problem, we propose in this paper a hybrid FS approach based on the ReliefF filter method and a novel metaheuristic Equilibrium Optimizer (EO). The proposed method, called RBEO-LS, is composed of two phases. In the first phase, the ReliefF algorithm is used as a preprocessing step to assign weights for features, which estimate their relevance to the classification task. In the second phase, the binary EO (BEO) is used as a wrapper search approach. The features are ranked according to their weights and are used for the initialization of the BEO population. We embedded the BEO with a local search strategy to improve its performance by adding relevant features and removing redundant ones from the features subset guided by the features ranking and the Pearson coefficient correlation. The performance of the developed algorithm has been evaluated on sixteen UCI datasets and ten high dimensional biological datasets. The UCI datasets contain a high number of samples and a small or medium number of features. The biological datasets present a high number of features with few samples. The results demonstrate that the use of the ReliefF algorithm and the local search strategy improves the performance of the EO algorithm. The results also show the superiority of the RBEO-LS, among other state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

The optimal power flow (OPF) is a vital tool for optimizing the control parameters of a power system by considering the desired objective functions subject to system constraints. Metaheuristic algorithms have been proven to be well-suited for solving complex optimization problems. The whale optimization algorithm (WOA) is one of the well-regarded metaheuristics that is widely used to solve different optimization problems. Despite the use of WOA in different fields of application as OPF, its effectiveness is decreased as the dimension size of the test system is increased. Therefore, in this paper, an effective whale optimization algorithm for solving optimal power flow problems (EWOA-OPF) is proposed. The main goal of this enhancement is to improve the exploration ability and maintain a proper balance between the exploration and exploitation of the canonical WOA. In the proposed algorithm, the movement strategy of whales is enhanced by introducing two new movement strategies: (1) encircling the prey using Levy motion and (2) searching for prey using Brownian motion that cooperate with canonical bubble-net attacking. To validate the proposed EWOA-OPF algorithm, a comparison among six well-known optimization algorithms is established to solve the OPF problem. All algorithms are used to optimize single- and multi-objective functions of the OPF under the system constraints. Standard IEEE 6-bus, IEEE 14-bus, IEEE 30-bus, and IEEE 118-bus test systems are used to evaluate the proposed EWOA-OPF and comparative algorithms for solving the OPF problem in diverse power system scale sizes. The comparison of results proves that the EWOA-OPF is able to solve single- and multi-objective OPF problems with better solutions than other comparative algorithms. [ABSTRACT FROM AUTHOR]

The advancement of technology has enabled the availability of a large amount of data from different sources. In such multi-view datasets, each view provides a particular representation for data objects and produces different partitions. Weighted Multi-view clustering approaches aim to find a suitable consensus clustering taking into consideration both the incompatibility between views and the relevance of features in each view. In this paper, a multi-objective weighted, Multi-view clustering method is presented based on gradient based optimizer. In the developed algorithm, a set of objective functions is considered that optimize the feature weights simultaneously in each view and the cluster centers that provide the optimal partitioning. Each candidate solution in our proposed method is evaluated by the weighted within-cluster compactness of the partitioning obtained from a single view and by the global weighted between-cluster dispersion among the partitioning provided by all views and the negative entropy among all clusters. To validate the clustering performance of developed approach, nine multi-view datasets with different statistical properties were used in this study. In addition, a real-world multi-omics data which contains four multi-omics datasets for cancer subtype discovery with three levels of omics data were considered. Experimental results demonstrate the ability of the new method to generate better clustering results than six popular multi-objective optimizers and ten state-of-the-art multi-view methods according to three measures, which are clustering accuracy, rand index, and normalized mutual information. [ABSTRACT FROM AUTHOR]

Currently, the world is still facing a COVID-19 (coronavirus disease 2019) classified as a highly infectious disease due to its rapid spreading. The shortage of X-ray machines may lead to critical situations and delay the diagnosis results, increasing the number of deaths. Therefore, the exploitation of deep learning (DL) and optimization algorithms can be advantageous in early diagnosis and COVID-19 detection. In this paper, we propose a framework for COVID-19 images classification using hybridization of DL and swarm-based algorithms. The MobileNetV3 is used as a backbone feature extraction to learn and extract relevant image representations as a DL model. As a swarm-based algorithm, the Aquila Optimizer (Aqu) is used as a feature selector to reduce the dimensionality of the image representations and improve the classification accuracy using only the most essential selected features. To validate the proposed framework, two datasets with X-ray and CT COVID-19 images are used. The obtained results from the experiments show a good performance of the proposed framework in terms of classification accuracy and dimensionality reduction during the feature extraction and selection phases. The Aqu feature selection algorithm achieves accuracy better than other methods in terms of performance metrics. [ABSTRACT FROM AUTHOR]

Superixel is one of the most efficient of the image segmentation approaches that are widely used for different applications. In this paper, we developed an image segmentation based on superpixel and an automatic clustering using q-Generalized Pareto distribution under linear normalization (q-GPDL), called ASCQPHGS. The proposed method uses the superpixel algorithm to segment the given image, then the Density Peaks clustering (DPC) is employed to the results obtained from the superpixel algorithm to produce a decision graph. The Hunger games search (HGS) algorithm is employed as a clustering method to segment the image. The proposed method is evaluated using two different datasets, collected form Berkeley segmentation dataset and benchmark (BSDS500) and standford background dataset (SBD). More so, the proposed method is compared to several methods to verify its performance and efficiency. Overall, the proposed method showed significant performance and it outperformed all compared methods using well-known performance metrics. [ABSTRACT FROM AUTHOR]

This paper proposes a modified marine predators algorithm based on quantum theory to handle the multilevel image segmentation problem. The main aims of using quantum theory is to enhance the ability of marine predators algorithm to find the optimal threshold levels to enhance the segmentation process. The proposed quantum marine predators algorithm gets the idea of finding a particle in the space based on a possible function borrowed from the Schrodinger wave function that determines the position of each particle at any time. This rectification in the search mechanism of the marine predators algorithm contributes to strengthening of exploration and exploitation of the algorithm. To analyze the performance of the proposed algorithm, we conduct a set of experiments. In the first experiment, the results of the developed quantum marine predators algorithm are compared with eight well-known meta-heuristics based on benchmark test functions. The second experiment demonstrates the applicability of the algorithm, in addressing multilevel threshold image segmentation. A set of ten gray-scale images assess the quality of the quantum marine predators algorithm and its performance is compared with other meta-heuristic algorithms. The experimental results show that the proposed algorithm performs well compared with other algorithms in terms of convergence and the quality of segmentation. • Improving Marine Predators Algorithm using the Quantum theory. • Using the proposed method as global optimization method. • Compare the performance of proposed with other well-known Metaheuristic methods. • Assess the quality of proposed approach using twenty-three problems and ten Benchmark images. [ABSTRACT FROM AUTHOR]

• A novel enhanced MPA algorithm has been proposed for effective PV modelling. • Static and dynamic PV model parameters have been estimated. • The estimated parameters have been validated via experimental data-sets. • The statistical analysis has been performed for effectiveness of the EMPA method. • The results confirm the EMPA efficiency comparing with state-of-the-art algorithms. Providing an accurate and precise photovoltaic model is a vital stage prior to the system design, therefore, this paper proposes a novel algorithm, enhanced marine predators algorithm (EMPA), to identify the unknown parameters for different photovoltaic (PV) models including the static PV models (single-diode and double-diode) and dynamic PV model. In the proposed EMPA, the differential evolution operator (DE) is incorporated into the original marine predators algorithm (MPA) to achieve stable, and reliable performance while handling that nonlinear optimization problem of PV modeling. Three different real datasets are used to show the effectiveness of the proposed algorithm. In the first case study, the proposed algorithm is used to identify the unknown parameters of a single-diode and double-diode PV models. The root-mean-square error (RMSE) and standard deviation (STD) values for a single-diode are 7.7301 e - 04 and 5.9135 e - 07 . Similarly for double diode are 7.4396 e - 04 and 3.1849 e - 05 , respectively. In addition, the second case study is used to test the proposed model in identifying the unknown parameters of a double-diode PV model. Here, the proposed algorithm is compared with classical MPA in five scenarios at different operating conditions. In this case study, the RMSE and STD of the proposed algorithm are less than that obtained by the MPA algorithm. Moreover, the third case study is utilized to test the ability of the proposed model in identifying the parameters of a dynamic PV model. In this case study, the performance of the proposed algorithm is compared with the one obtained by MAP and heterogeneous comprehensive learning particle swarm optimization (HCLPSO) algorithms in terms of RMSE ± STD. The obtained value of RMSE ± STD by the proposed algorithm is 0.0084505 ± 1.0971 e - 17 , which is too small compared with that obtained by MPA and HCLPSO algorithms (0.0084505 ± 9.6235 e - 14 and 0.0084505 ± 2.5235 e - 9). The results show the proposed model's superiority over the MPA and other recent proposed algorithms in data fitting, convergence rate, stability, and consistency. Therefore, the proposed algorithm can be considered as a fast, feasible, and a reliable optimization algorithm to identify the unknown parameters in static and dynamic PV models. The code of the dynamic PV models is available via this link: https://github.com/DAyousri/Identifying-the-parameters-of-the-integer-and-fractional-order-dynamic-PV-models?_ga=2.104793926.732834951.1616028563-1268395487.1616028563. [ABSTRACT FROM AUTHOR]

• A new multi-objective optimization method used OBL strategy, WOA and DE algorithms • It combines DE and the OBL to improve the performance of the WOA • The MWDEO results outperformed all other algorithms in most of the test problems • 32 multi-objective test problems are used in the experiments and CEC2017 problems The optimization problems are divided into a single objective and multi-objective. Single objective optimization has only one objective function; whereas, multi-objective optimization has multiple objective functions that generate the Pareto set; therefore, solving a multi-objective problem is a challenging problem. This paper presents a new multi-objective optimization method (called MWDEO) based on improved whale optimization algorithm (WOA) by combining the differential evolution (DE) algorithm and the opposition-based learning (OBL). The MWDEO uses the WOA to perform a global exploration, whereas DE is used to exploit the search space; while the OBL is applied to improve the exploration and exploitation by generating the opposite values. The proposed algorithm is evaluated using 32 multi-objective test problems besides a set of benchmark problems of CEC'2017. The experimental results are compared with nine state-of-the-art multi-objective methods. The analysis of the results showed that the proposed MWDEO outperformed all other algorithms in most of the test problems which indicates that the proposed MWDEO is competitive and effective in solving different types of multi-objective problems. [ABSTRACT FROM AUTHOR]

• The LSHADE algorithm is proposed for accurate MRBI segmentation. • The minimum cross entropy is used by the LSHADE as objective function. • The proposed segmentation method is tested over different datasets of MRBI. • Segmentation metrics verify the quality of the LSHADE results in MRBI. • By using LSHADE segmentation, it is possible to identify tumors in MRBI. Segmentation is an essential preprocessing step in techniques for image analysis. The automatic segmentation of brain magnetic resonance imaging has been exhaustively investigated since the accurate use of this kind of methods permits the diagnosis and identification of several diseases. Thresholding is a straightforward and efficient technique for image segmentation. Nonetheless, thresholding based approaches tend to increase the computational cost based on the number of thresholds used for the segmentation. Therefore, metaheuristic algorithms are an important tool that helps to find the optimal values in multilevel thresholding. The adaptive differential evolution, based in numerous successes through history, with linear population size reduction (LSHADE) is a robust metaheuristic algorithm that efficiently solves numerical optimization problems. The main advantage of LSHADE is its capability to adapt its internal parameters according to prior knowledge acquired along the evolutionary process. Meanwhile, the continuous reduction of the population improves the exploitation process. This article presents a multilevel thresholding approach based on the LSHADE method for the segmentation of magnetic resonance brain imaging. The proposed method has been tested using three groups of reference images— the first group consists of grayscale standard benchmark images, the second group consists of magnetic resonance T2-weighted brain images, and the third group is formed by images of unhealthy brains affected by tumors. In turn, the performance of the intended approach was compared with distinct metaheuristic algorithms and machine learning methods. The statistically verified results demonstrate that the suggested approach improves consistency and segmentation quality. [ABSTRACT FROM AUTHOR]

Solving the feature selection problem is considered an important issue when addressing data from real applications that contain a large number of features. However, not all of these features are important; therefore, the redundant features must be removed because they affect the accuracy of the data representation and introduce time complexity into the analysis of these data. For these reasons, the feature selection problem is considered an NP-complete nonlinearly constrained optimization problem. The rough set (RS) and neighborhood rough set (NRS) are the most powerful methods used to solve the feature selection problem; however, both approaches suffer from high time complexity. To avoid these limitations, we combined the RS and NRS with a new metaheuristic algorithm called the runner-root algorithm (RRA). The spirit of the RRA originated from real-life plants called running plants, which have roots and runners that spread the plants in search of minerals and water resources through their root and runner development. To validate the proposed algorithm, several UCI Machine Learning Repository datasets are used to compute the performance of our algorithm employing two effective classifiers, the random forest and the K-nearest neighbor, in addition to some other measures for the performance evaluation. The experimental results illustrate that the proposed algorithm is superior to the state-of-the-art metaheuristic algorithms in terms of the performance measures. Additionally, the NRS increases the performance of the proposed method more than the RS as an objective function. • A feature selection (FS) method for classification task is proposed. • Proposed approach improved Runner-Root Algorithm by using its binary version. • Degree of dependency from RS and Neighborhood RS are used as objective functions. • Proposed method used to select an optimal subset of features from twelve datasets. • Our proposed method gives better accuracy with a small number of features. [ABSTRACT FROM AUTHOR]

• Apply the enhanced crow search algorithm used as Feature selection approach. • Dynamic local neighborhood and adaptive awareness probability used to improve CSA. • Evaluate the performance of the proposed method using a set of UCI machine datasets. • Developed approach outperforms other feature selection approaches. The crow search algorithm (CSA) is a recent metaheuristic inspired by the intelligent group behavior of crows. It has attracted the attention of many researchers because of its simplicity and easy implementation. However, it suffers from premature convergence because of its ability to balance between exploration and exploitation is weak. Therefore, we investigate in this paper, an enhanced version of CSA called by us ECSA as a wrapper feature selection method to extract the best feature subsets. This enhancement achieved by introducing three modifications to the original CSA to improve its performance. Firstly, we propose an adaptive awareness probability to enhance the balance between exploration and exploitation. Secondly, we replace the random choice of the crow to follow by the dynamic local neighborhood to guide the local search. Thirdly, we introduce a novel global search strategy to increase the global exploration capability of the crow. The performance of ECSA is measured using three performance metrics and statistical significance over 16 datasets from the UCI repository. The obtained results are compared with those of the original CSA and some state-of-the-art techniques in the literature. Experimental results showed that ECSA presents a better convergence speed and a better-quality solution. [ABSTRACT FROM AUTHOR]

The first issue in the optimal photovoltaic system design is providing an accurate PV model that emulates the system behaviour under several environmental conditions. The accuracy of the photovoltaic model stands on its identified parameters that are mainly based on the executed optimization technique and the employed objective function. As per the literature, two methodologies have been applied for computing the estimated current in the objective function, detecting the most efficient one is the first step for achieving high qualified and precise solutions. Motivated by that, we investigate the two objective functions with considering several novel optimization algorithms. The implemented algorithms are marine predators algorithm, Slime mould algorithm, atom search optimization, Political Optimizer, Parasitism–Predation algorithm as well as harris hawk optimizer and salp swarm algorithm. The Lambert function forms have been used for validating the results. Several profiles of the experimental datasets are measured under different levels of temperature and irradiation conditions to identify the single, double and three diode models parameters of the RTC France solar cell and Canadian-Solar-(CS6P-240P) multi-crystalline solar panel. The main findings show that, applying Newton–Raphson while computing the estimated current in the objective function enhances the algorithms performance to provide the more precise and accurate parameters in comparison with using the measured current and solve the photovoltaic model equation linearly. Moreover, the marine predators algorithm confirms the quality of its solutions and provides a better representation for the photovoltaic datasets with high stability based on the lambert forms and the statistical analyses. • Investigate two objective functions to determine the more accurate to estimate PV parameters. • Propose a new five techniques, including MPA, SMA, ASO, PO, and PPA, as PV parameter estimation methods. • Evaluate the tested algorithms and two objectives using different diode models. • Apply the Lambert function to report the accuracy of the identified parameters and reliability of the objective function. • Assess the quality of the proposed five algorithms through five experimentally measured datasets. [ABSTRACT FROM AUTHOR]

• FLAT algorithm was improved based on an enhanced version of BAT algorithm. • Proposed model integrates BAT with PSO using a novel infection propagation mechanism. • Performance of developed model was evaluated on a huge lengths protein sequence. • FLAT based on BPINF was used to detect longest consecutive subsequences of COVID19. • Performance of FLAT was evaluated using real dataset and compared with other methods. The longest common consecutive subsequences (LCCS) play a vital role in revealing the biological relationships between DNA/RNA sequences especially the newly discovered ones such as COVID-19. FLAT is a Fragmented local aligner technique which is an accelerated version of the local pairwise sequence alignment algorithm based on meta -heuristic algorithms. The performance of FLAT needs to be enhanced since the huge length of biological sequences leads to trapping in local optima. This paper introduces a modified version of FLAT based on improving the performance of the BA algorithm by integration with particle swarm optimization (PSO) algorithm based on a novel infection mechanism. The proposed algorithm, named BPINF, depends on finding the best-explored solution using BA operators which can infect the agents during the exploitation phase using PSO operators to move toward it instead of moving toward the best-exploited solution. Hence, moving the solutions toward the two best solutions increase the diversity of generated solutions and avoids trapping in local optima. The infection can be propagated through the agents where each infected agent can transfer the infection to other non-infected agents which enhances the diversification of generated solutions. FLAT using the proposed technique (BPINF) was validated to detect LCCS between a set of real biological sequences with huge lengths besides COVID-19 and other well-known viruses. The performance of BPINF was compared to the enhanced versions of BA in the literature and the relevant studies of FLAT. It has a preponderance to find the LCCS with the highest percentage (88%) which is better than other state-of-the-art methods. [ABSTRACT FROM AUTHOR]