Improved Binary Adaptive Wind Driven Optimization Algorithm-Based Dimensionality Reduction for Supervised Classification

An improved Differential evolution with Sailfish optimizer (DESFO) for handling feature selection problem

As a preprocessing for machine learning and data mining, Feature Selection plays an important role. Feature selection aims to streamline high-dimensional data by eliminating irrelevant and redundant features, which reduces the potential curse of dimensionality of a given large dataset. When working with datasets containing many features, algorithms that aim to identify the most valuable features to improve dataset accuracy may encounter difficulties because of local optima. Many studies have been conducted to solve this problem. One of the solutions is to use meta-heuristic techniques. This paper presents a combination of the Differential evolution and the sailfish optimizer algorithms (DESFO) to tackle the feature selection problem. To assess the effectiveness of the proposed algorithm, a comparison between Differential Evolution, sailfish optimizer, and nine other modern algorithms, including different optimization algorithms, is presented. The evaluation used Random forest and key nearest neighbors as quality measures. The experimental results show that the proposed algorithm is a superior algorithm compared to others. It significantly impacts high classification accuracy, achieving 85.7% with the Random Forest classifier and 100% with the Key Nearest Neighbors classifier across 14 multi-scale benchmarks. According to fitness values, it gained 71% with the Random forest and 85.7% with the Key Nearest Neighbors classifiers.

Solving Engineering Optimization Problems Based on Multi-Strategy Particle Swarm Optimization Hybrid Dandelion Optimization Algorithm

In recent years, swarm intelligence optimization methods have been increasingly applied in many fields such as mechanical design, microgrid scheduling, drone technology, neural network training, and multi-objective optimization. In this paper, a multi-strategy particle swarm optimization hybrid dandelion optimization algorithm (PSODO) is proposed, which is based on the problems of slow optimization speed and being easily susceptible to falling into local extremum in the optimization ability of the dandelion optimization algorithm. This hybrid algorithm makes the whole algorithm more diverse by introducing the strong global search ability of particle swarm optimization and the unique individual update rules of the dandelion algorithm (i.e., rising, falling and landing). The ascending and descending stages of dandelion also help to introduce more changes and explorations into the search space, thus better balancing the global and local search. The experimental results show that compared with other algorithms, the proposed PSODO algorithm greatly improves the global optimal value search ability, convergence speed and optimization speed. The effectiveness and feasibility of the PSODO algorithm are verified by solving 22 benchmark functions and three engineering design problems with different complexities in CEC 2005 and comparing it with other optimization algorithms.

Estimation of coconut maturity based on fuzzy neural network and sperm whale optimization

Coconut water is the clear liquid found inside coconuts, famous for rehydrating after exercise or while suffering from a minor sickness. The essential issue tackled in this paper is how to estimate the appropriate stage of maturity of coconut water, which is a time-consuming task in the beverage industry since, as the coconut age increases, the coconut water flavor varies. Accordingly, to handle this issue, an adaptive model based on Fuzzy Neural Network and Sperm Whale Optimization, dubbed FNN–SWO, is developed to assess coconut water maturity. The Sperm Whale Optimization (SWO) algorithm is a meta-heuristic optimization algorithm. It is embedded in this model along with neural networks and fuzzy techniques (FNN system), which can be employed as an essential building block in the beverage industry. The proposed FNN–SWO model is trained and tested utilizing fuzzy rules with an adaptive network. In contrast, the SWO algorithm is adopted to determine the optimal weights for the fuzzy rules. Three subsets of data divided according to three levels of coconut water maturity-tender, mature, and very mature, are used to validate the combined FNN–SWO model. Depending on these three subsets of data, a comparison of the proposed FNN–SWO model has been conducted against a set of the most common conventional techniques. These techniques include Support Vector Machine, Naïve Bayes, FNN, Artificial Neural Network, as well as their embedding with other meta-heuristic optimization algorithms. For various key performance indicators, such as recall, F1-score, specificity, and accuracy, the proposed FNN–SWO model provides the best prediction outcomes compared to the current time-consuming techniques. The dominance of the proposed FNN–SWO model is evident from the final findings compared to its time-consuming peers for estimating coconut water maturity on time. As a result, the proposed FNN–SWO model is an effective heuristic for locating optimal solutions to classification problems. It can thereby be reassuringly applicable to other similar prediction problems. Additionally, it would benefit the scientific community interested in evaluating coconut water.

A weighted-sum chaotic sparrow search algorithm for interdisciplinary feature selection and data classification

In today's data-driven digital culture, there is a critical demand for optimized solutions that essentially reduce operating expenses while attempting to increase productivity. The amount of memory and processing time that can be used to process enormous volumes of data are subject to a number of limitations. This would undoubtedly be more of a problem if a dataset contained redundant and uninteresting information. For instance, many datasets contain a number of non-informative features that primarily deceive a given classification algorithm. In order to tackle this, researchers have been developing a variety of feature selection (FS) techniques that aim to eliminate unnecessary information from the raw datasets before putting them in front of a machine learning (ML) algorithm. Meta-heuristic optimization algorithms are often a solid choice to solve NP-hard problems like FS. In this study, we present a wrapper FS technique based on the sparrow search algorithm (SSA), a type of meta-heuristic. SSA is a swarm intelligence (SI) method that stands out because of its quick convergence and improved stability. SSA does have some drawbacks, like lower swarm diversity and weak exploration ability in late iterations, like the majority of SI algorithms. So, using ten chaotic maps, we try to ameliorate SSA in three ways: (i) the initial swarm generation; (ii) the substitution of two random variables in SSA; and (iii) clamping the sparrows crossing the search range. As a result, we get CSSA, a chaotic form of SSA. Extensive comparisons show CSSA to be superior in terms of swarm diversity and convergence speed in solving various representative functions from the Institute of Electrical and Electronics Engineers (IEEE) Congress on Evolutionary Computation (CEC) benchmark set. Furthermore, experimental analysis of CSSA on eighteen interdisciplinary, multi-scale ML datasets from the University of California Irvine (UCI) data repository, as well as three high-dimensional microarray datasets, demonstrates that CSSA outperforms twelve state-of-the-art algorithms in a classification task based on FS discipline. Finally, a 5%-significance-level statistical post-hoc analysis based on Wilcoxon's signed-rank test, Friedman's rank test, and Nemenyi's test confirms CSSA's significance in terms of overall fitness, classification accuracy, selected feature size, computational time, convergence trace, and stability.