A comparison between chaos theory and Lévy flights in sunflower optimization for feature selection

Abstract

Feature selection is a knowledge discovery tool to understand the problem by analysing features. In particular, the application of feature selection in data mining can not only improve the quality of extracted patterns and knowledge but also decrease computational costs. Various techniques have been applied to this complex optimization problem, in which metaheuristics have been validated to be superior. This study introduces a new metaheuristic known for having lean and fast programming, inspired by the sunflower's motions for feature selection for the first time. It is equipped with a v‐shaped transfer function and associated with the KNN classifier to become the binary sunflower optimization (BSFO). A total of 12 variants of BSFO are designed based on the chaos theory and Lévy flights, called improved binary sunflower optimization (IBSFO). A discussion between these improvement theories for feature selection has also not been made yet, and it is performed in this paper using 15 benchmark datasets from the UCI repository. The experimental results show that all variants can advance the fitness value of BSFO, and nine of them considerably decrease the computational costs. Furthermore, the chaotic BSFO with the Chebyshev function, taking replacement to normal rand, has the lowest fitness value (−11.37%) and execution time (−9.31%) than the original BSFO. Further, IBSFO is compared with another eight metaheuristics and outperforms these competitors on average fitness value and execution time. Overall, IBSFO proved to find subsets with reduced dimension and high accuracy with meagre computational cost due to its robust explorative and exploitative capacities.