Search

Dealing with classification problems requires the crucial step of feature selection (FS), which helps to reduce data dimensions and shorten classification time. Feature selection and support vector machines (SVM) classification method for banknote dirtiness recognition based on marine predator algorithm (MPA) with mathematical functions was proposed. The mathematical functions were mainly used to improve the optimizatio of MPA for feature parameter selection, and the loss function and kernel function parameters of the SVM are optimized by slime mold optimization algorithm (SMA) and marine predator algorithm. According to the experimental results, the accuracy of identifying dirtiness on the entire surface of the banknote reaches 89.07%. At the same time, according to the image pattern distribution of the banknoteS, the white area image in the middle left of the collected banknote is selected by the same method to select the feature parameters and identify the dirtiness of the banknoteS. The accuracy of dirtiness recognition in the middle left white area reached 86.67%, this shows that the white area in the middle left can basically completely replace the entire banknote. To confirm the effectiveness of the feature selection method, the proposed optimization method has been compared with four other swarm intelligent optimization algorithms to verify its performance. The experiment results indicate that the enhanced strategy is successful in improving the performance of MPA. Moreover, the robustness analysis proves its effectiveness. [ABSTRACT FROM AUTHOR]

In most data mining tasks, feature selection is an essential preprocessing stage. Henry's Gas Solubility Optimization (HGSO) algorithm is a physical heuristic algorithm based on Henry's law, which simulates the process of gas solubility in liquid with temperature. In this paper, an improved Henry's Gas Solubility Optimization based on stochastic fractal search (SFS-HGSO) is proposed for feature selection and engineering optimization. Three stochastic fractal strategies based on Gaussian walk, Lévy flight and Brownian motion are adopted respectively, and the diffusion is based on the high-quality solutions obtained by the original algorithm. Individuals with different fitness are assigned different energies, and the number of diffusing individuals is determined according to individual energy. This strategy increases the diversity of search strategies and enhances the ability of local search. It greatly improves the shortcomings of the original HGSO position updating method is single and the convergence speed is slow. This algorithm is used to solve the problem of feature selection, and KNN classifier is used to evaluate the effectiveness of selected features. In order to verify the performance of the proposed feature selection method, 20 standard UCI benchmark datasets are used, and the performance is compared with other swarm intelligence optimization algorithms, such as WOA, HHO and HBA. The algorithm is also applied to the solution of benchmark function. Experimental results show that these three improved strategies can effectively improve the performance of HGSO algorithm, and achieve excellent results in feature selection and engineering optimization problems. [ABSTRACT FROM AUTHOR]