Binary Symbiotic Organism Search Algorithm For Feature Selection And Analysis

Feature selection is a challenging step in the field of data mining, because there are many local optimal solutions in a feature space. Feature selection can be considered an optimization problem, which requires as few feature combinations as possible and high accuracy. The binary symbiotic organism search (BSOS) algorithm is proposed in this paper. It maps the symbiotic organism search algorithm from a continuous space to a discrete space using an adaptive S-shaped transfer function and can be used to search for the optimal feature subset in a feature selection space. The proposed BSOS algorithm is evaluated using 19 datasets from the UCI repository. First, the results of four basic S-shaped transfer functions are compared with those of the adaptive S-shaped transfer function. Additionally, the experimental results are compared with the results obtained by the popular binary grasshopper optimization, binary gray wolf optimization, traditional binary particle swarm optimization, and binary differential evolution algorithms, which are also employed for feature selection in the existing literature. The experimental results show that the BSOS algorithm can find the fewest number of features in most datasets and achieve a high classification accuracy. Moreover, the experiments also show that the BSOS algorithm is still at a disadvantage in handling low-dimensional datasets and attains low sensitivity in hyperdimensional datasets.