MPA + SVM: An Active Feature Selection Approach in High-Dimensional Data Sets

Protein membership prediction is a fundamental task to retrieve information for unknown or unidentified sequences. When support vector machines (SVMs) are associated with the right kernels, this machine learning technique can build state-of-the-art classifiers. However, traditional implementations work in a batch fashion, limiting the application to very large and high dimensional data sets, typical in biology. Incremental SVMs introduce an alternative to batch algorithms, and a good candidate to solve these problems. In this work several experiments are conducted to evaluate the performance of the incremental SVM on remote homology detection using a benchmark data set. The main advantages are shown, opening the possibility to further improve the algorithm in order to achieve even better classifiers.

Artificial neural networks (ANNs) are used to solve many problems, such as modeling, identification, prediction, and classification. The success of ANN is directly related to the training process. Meta-heuristic algorithms are used extensively for ANN training. Within the scope of this study, a feed-forward artificial neural network (FFNN) is trained using the marine predators algorithm (MPA), one of the current meta-heuristic algorithms. Namely, this study is aimed to evaluate the performance of MPA in ANN training in detail. Identification/modeling of nonlinear systems is chosen as the problem. Six nonlinear systems are used in the applications. Some of them are static, and some are dynamic. Mean squared error (MSE) is utilized as the error metric. Effective training and testing results were obtained using MPA. The best mean error values obtained for six nonlinear systems are 2.3 × 10−4, 1.8 × 10−3, 1.0 × 10−4, 1.0 × 10−4, 1.2 × 10−5, and 2.5 × 10−4. The performance of MPA is compared with 16 meta-heuristic algorithms. The results have shown that the performance of MPA is better than other algorithms in ANN training for the identification of nonlinear systems.

Recycling tasks are the most effective method for reducing waste generation, protecting the environment, and boosting the overall national economy. The productivity and effectiveness of the recycling process are strongly dependent on the cleanliness and precision of processed primary sources. However, recycling operations are often labor intensive, and computer vision and deep learning (DL) techniques aid in automatically detecting and classifying trash types during recycling chores. Due to the dimensional challenge posed by pre-trained CNN networks, the scientific community has developed numerous techniques inspired by biology, swarm intelligence theory, physics, and mathematical rules. This research applies a new meta-heuristic algorithm called the artificial hummingbird algorithm (AHA) to solving the waste classification problem based on feature selection. However, the performance of the AHA is barely satisfactory; it may be stuck in optimal local regions or have a slow convergence. To overcome these limitations, this paper develops two improved versions of the AHA called the AHA-ROBL and the AHA-OBL. These two versions enhance the exploitation stage by using random opposition-based learning (ROBL) and opposition-based learning (OBL) to prevent local optima and accelerate the convergence. The main purpose of this paper is to apply the AHA-ROBL and AHA-OBL to select the relevant deep features provided by two pre-trained models of CNN (VGG19 & ResNet20) to recognize a waste classification. The TrashNet dataset is used to verify the performance of the two proposed approaches (the AHA-ROBL and AHA-OBL). The effectiveness of the suggested methods (the AHA-ROBL and AHA-OBL) is compared with that of 12 modern and competitive optimizers, namely the artificial hummingbird algorithm (AHA), Harris hawks optimizer (HHO), Salp swarm algorithm (SSA), aquila optimizer (AO), Henry gas solubility optimizer (HGSO), particle swarm optimizer (PSO), grey wolf optimizer (GWO), Archimedes optimization algorithm (AOA), manta ray foraging optimizer (MRFO), sine cosine algorithm (SCA), marine predators algorithm (MPA), and rescue optimization algorithm (SAR). A fair evaluation of the proposed algorithms’ performance is achieved using the same dataset. The performance analysis of the two proposed algorithms is applied in terms of different measures. The experimental results confirm the two proposed algorithms’ superiority over other comparative algorithms. The AHA-ROBL and AHA-OBL produce the optimal number of selected features with the highest degree of precision.

The Telecommunications (telecom) Industry is saturated and marketing strategies are focusing on customer retention and churn prevention. Churning is when a customer stops using a company’s service thereby opting for the next available service provider. This churn threat has led to various Customer Churn Prediction (CCP) studies and many models have been developed to predict possible churn cases for timely retention strategies. This review looks at the existing models in literature, using 30 selected CCP studies particularly from 2014 to 2017. Data preparation methods and churn prediction challenges have also been explored. This study reveals that Support Vector Machines, Naïve Bayes, Decision Trees and Neural Networks are the mostly used CCP techniques. Feature selection is the mostly used data preparation method followed by Normalization and Noise removal. Undersampling is the mostly preferred technique for handling telecom data class imbalances. Imbalanced, large and high dimensional datasets are the key challenges in telecom churn prediction. The issue of large telecom datasets is handled by use of new big data technologies such as Hadoop, Hbase and NoSQL (Not only Structured Query Language) though their adoption is still at a low rate.

Multi-strategy enhanced Marine Predators Algorithm with applications in engineering optimization and feature selection problems

This study presents an advanced metaheuristic approach termed the Enhanced Gorilla Troops Optimizer (EGTO), which builds upon the Marine Predators Algorithm (MPA) to enhance the search capabilities of the Gorilla Troops Optimizer (GTO). Like numerous other metaheuristic algorithms, the GTO encounters difficulties in preserving convergence accuracy and stability, notably when tackling intricate and adaptable optimization problems, especially when compared to more advanced optimization techniques. Addressing these challenges and aiming for improved performance, this paper proposes the EGTO, integrating high and low-velocity ratios inspired by the MPA. The EGTO technique effectively balances exploration and exploitation phases, achieving impressive results by utilizing fewer parameters and operations. Evaluation on a diverse array of benchmark functions, comprising 23 established functions and ten complex ones from the CEC2019 benchmark, highlights its performance. Comparative analysis against established optimization techniques reveals EGTO's superiority, consistently outperforming its counterparts such as tuna swarm optimization, grey wolf optimizer, gradient based optimizer, artificial rabbits optimization algorithm, pelican optimization algorithm, Runge Kutta optimization algorithm (RUN), and original GTO algorithms across various test functions. Furthermore, EGTO's efficacy extends to addressing seven challenging engineering design problems, encompassing three-bar truss design, compression spring design, pressure vessel design, cantilever beam design, welded beam design, speed reducer design, and gear train design. The results showcase EGTO's robust convergence rate, its adeptness in locating local/global optima, and its supremacy over alternative methodologies explored.

Marine Predators Algorithm (MPA) is a recent efficient metaheuristic algorithm that is enlightened by the biological behavior of ocean predators and prey. This algorithm simulates the Levy and Brownian movements of prevalent foraging strategy and has been applied to many complex optimization problems. However, the algorithm has defects such as a low diversity of the solutions, ease into the local optimal solutions, and decreasing convergence speed in dealing with complex problems. A modified version of this algorithm called ODMPA is proposed based on the tent map, the outpost mechanism, and the differential evolution mutation with simulated annealing (DE-SA) mechanism. The tent map and DE-SA mechanism are added to enhance the exploration capability of MPA by increasing the diversity of the search agents, and the outpost mechanism is mainly used to improve the convergence speed of MPA. To validate the outstanding performance of the ODMPA, a series of global optimization problems are selected as the test sets, including the standard IEEE CEC2014 benchmark functions, which are the authoritative test set, three well-known engineering problems, and photovoltaic model parameters tasks. Compared with some famous algorithms, the results reveal that ODMPA has achieved better performance than its counterparts in CEC2014 benchmark functions. And in solving real-world optimization problems, ODMPA could get higher accuracy than other metaheuristic algorithms. These practical results demonstrate that the mechanisms introduced positively affect the original MPA, and the proposed ODMPA can be a widely effective tool in tackling many optimization problems.

After studying the behavior of monarch butterflies in nature, Wang et al. proposed a new promising swarm intelligence algorithm, called monarch butterfly optimization (MBO), for addressing unconstrained optimization tasks. In the basic MBO algorithm, the fixed butterfly adjusting rate is used to carry out the butterfly adjusting operator. In this paper, the self-adaptive strategy is introduced to adjust the butterfly adjusting rate. In addition, the crossover operator that is generally used in evolutionary algorithms (EAs) is used to further improve the quality of butterfly individuals. The two optimization strategies, self-adaptive and crossover operator, are combined, and then self-adaptive crossover operator is proposed. After incorporating the above strategies into the basic MBO algorithm, a new version of MBO algorithm, called Self-adaptive Monarch Butterfly Optimization (SaMBO), is put forward. Also, few studies of constrained optimization has been done for MBO research. In this paper, in order to verify the performance of our proposed SaMBO algorithm, the proposed SaMBO algorithm is further benchmarked by 21 CEC 2017 constrained optimization problems. The experimental results indicate that the proposed SaMBO algorithm outperforms the basic MBO and other five state-of-the-art metaheuristic algorithms.

With the in-depth implementation of China’s “National Strategy for Building a Strong Transportation Network,” the scale of expressway construction has continued to expand. As a result, the number of high-fill and deep-cut subgrade projects under complex geological conditions has increased significantly, leading to a surge in landslide-related issues. Consequently, accurate prediction of slope displacement is of critical importance for early warning and prevention of landslide disasters. This study proposes a hybrid prediction model, VMD-MPA-LSSVM-LSTM (VMLL), which integrates Variational Mode Decomposition (VMD), Marine Predators Algorithm (MPA), Least Squares Support Vector Machine (LSSVM), and Long Short-Term Memory (LSTM) networks. Using monitoring data from the high-fill embankment slope at Hongtuyao as the research subject, the VMLL model is employed to predict slope displacement based on small-sample data. The objective is to provide a more accurate method for early warning of slope displacement. Firstly, the original monitoring data are decomposed into trend displacement components and fluctuation displacement components using Variational Mode Decomposition (VMD). Subsequently, the trend component and the fluctuation component are predicted using Least Squares Support Vector Machine (LSSVM) and Long Short-Term Memory (LSTM) networks, respectively. Finally, the Marine Predators Algorithm (MPA) is employed to optimize the hyperparameters of the predictive models. Based on this framework, a VMLL-based slope displacement prediction model is constructed. To verify the superiority of the VMLL model, a comparative analysis was conducted against LSSVM, LSTM, and the VMD-LSSVM-LSTM models. The results demonstrate that the VMLL model achieves the highest prediction accuracy, with a Mean Absolute Percentage Error (MAPE) of 0.4022%, a Mean Absolute Error (MAE) of 0.016 mm, a Root Mean Square Error (RMSE) of 0.0206 mm, a coefficient of determination (R²) of 94.08%, and a Variance Accounted For (VAF) of 96.5%. Compared with the other three models, the VMLL model reduces the MAPE, MAE, and RMSE by 30.41–67.62%, 30.38–67.40%, and 27.32–71.00%, respectively. Meanwhile, it improves the R² and VAF by 5.95–217.51% and 0.38–11.48%, respectively. These improvements clearly demonstrate that the VMLL model outperforms the other models, indicating its significant advantage over single prediction models. Furthermore, three additional datasets were used to evaluate the model’s performance. The average values of the performance evaluation metrics for these datasets were 0.6207% (MAPE), 0.0238 mm(MAE), 0.0273 mm(RMSE), 90.33%(R²), and 96.81%(VAF), respectively. These results demonstrate the high accuracy and strong robustness of the proposed model in predicting both horizontal displacement and vertical settlement of slopes, providing a reliable methodological framework for slope stability assessment and landslide disaster early warning.

Data clustering is a fundamental challenge in data analytics. It is the main task in exploratory data mining and a core technique in machine learning. As the volume, variety, velocity, and variability of data grows, we need more efficient data analysis methods that can scale towards increasingly large and high dimensional data sets. We develop a streaming clustering algorithm that is highly amenable to hardware acceleration. Our algorithm eliminates the need to store the data objects, which removes limits on the size of the data that we can analyze. Our algorithm is highly parameterizable, which allows it to fit to the characteristics of the data set, and scale towards the available hardware resources. Our streaming hardware core can handle more than 40 Msamples/s when processing 3-dimensional streaming data and up to 1.78 Msamples/s for 70-dimensional data. To validate the accuracy and performance of our algorithms we compare it with several common clustering techniques on several different applications. The experimental result shows that it outperforms other prior hardware accelerated clustering systems.

Cancer survival classification using integrated data sets and intermediate information.

Spiral Gaussian mutation sine cosine algorithm: Framework and comprehensive performance optimization

In conventional distributed machine learning methods, distributed support vector machines (SVM) algorithms are trained over pre-configured intranet/internet environments to find out an optimal classifier. These methods are very complicated and costly for large datasets. Hence, we propose a method that is referred as the Cloud SVM training mechanism (CloudSVM) in a cloud computing environment with MapReduce technique for distributed machine learning applications. Accordingly, (i) SVM algorithm is trained in distributed cloud storage servers that work concurrently; (ii) merge all support vectors in every trained cloud node; and (iii) iterate these two steps until the SVM converges to the optimal classifier function. Single computer is incapable to train SVM algorithm with large scale data sets. The results of this study are important for training of large scale data sets for machine learning applications. We provided that iterative training of splitted data set in cloud computing environment using SVM will converge to a global optimal classifier in finite iteration size.

Monarch butterfly optimization is inspired by the migration of monarch butterflies in nature: monarch butterflies in eastern North America migrate southward from northern United States and southern Canada to Mexico every summer/autumn. It is a new swarm intelligence metaheuristic algorithm, which is called monarch butterfly optimization (MBO). In MBO, the monarch butterfly population is ideally divided into two populations, one is located in southern Canada and northern United States (land 1), and the other is located in Mexico (land 2). We update the individuals in the population through migration and butterfly shape adjustment. To maintain the diversity of the population and minimize the fitness value, the total number of butterflies generated by the operation should be equal to the original population. In the experiment, MBO is compared with five metaheuristic algorithms through 38 test functions, especially applied to solve a large-scale 0-1 knapsack (KP) problem. Three groups of 15 large-scale 0-1 KP cases from 800 to 2000 dimensions are used to test. It is proved that MBO has strong advantages in solving global numerical optimization and engineering problems, which provides a reference for further discussion of MBO in the future.

In this study, the newly developed Marine Predators Algorithm (MPA) is formulated to minimize the weight of truss structures. MPA is a swarm-based metaheuristic algorithm inspired by the efficient foraging strategies of marine predators in oceanic environments. In order to assess the robustness of the proposed method, three normal-sized structural benchmarks (10-bar, 60-bar, and 120-bar spatial dome) and three large-scale structures (272-bar, 942-bar, and 4666-bar truss tower) were selected from the literature. Results point to the inherent strength of MPA against all state-of-the-art metaheuristic optimizers implemented so far. Moreover, for the first time in the field, a quantitative evaluation and an answer to the age-old question of the proper convergence behavior (exploration vs. exploitation balance) in the context of structural optimization is conducted. Therefore, a novel dimension-wise diversity index is adopted as a methodology to investigate each of the two schemes. It was concluded that the balance that produced the best results was about 90% exploitation and 10% exploration (on average for the entire computational process).