Feature selection method based on stochastic fractal search henry gas solubility optimization algorithm

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of intelligent & fuzzy systems 2023-01, Vol.44 (3), p.5377-5406
Main Authors: Zhang, Min, Wang, Jie-Sheng, Liu, Yu, Wang, Min, Li, Xu-Dong, Guo, Fu-Jun
Format: Article
Language:English
Subjects:
Algorithms
Benchmarks
Brownian motion
Data mining
Feature selection
Fractals
Gas solubility
Heuristic methods
Optimization
Performance enhancement
Performance evaluation
Search methods
Swarm intelligence
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1064-1246
1875-8967
DOI:10.3233/JIFS-221036