An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems

doi:10.1016/j.knosys.2018.05.009

Return

An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems

2018-08-01

512

DOI：10.1016/j.knosys.2018.05.009

Original

Save

View PDF

Abstract

En 中文

Searching for the (near) optimal subset of features is a challenging problem in the process of feature selection (FS). In the literature, Swarm Intelligence (SI) algorithms show superior performance in solving this problem. This motivated our attempts to test the performance of the newly proposed Salp Swarm Algorithm (SSA) in this area. As such, two new wrapper FS approaches that use SSA as the search strategy are proposed. In the first approach, eight transfer functions are employed to convert the continuous version of SSA to binary. In the second approach, the crossover operator is used in addition to the transfer functions to replace the average operator and enhance the exploratory behavior of the algorithm. The proposed approaches are benchmarked on 22 well-known UCI datasets and the results are compared with 5 FS methods: Binary Grey Wolf Optimizer (BGWO), Binary Gravitational Search Algorithms (BGSA), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO), and Genetic Algorithm (GA). The paper also considers an extensive study of the parameter setting for the proposed technique. From the results, it is observed that the proposed approach significantly outperforms others on around 90% of the datasets.

Keywords:

Wrapper feature selection

Salp Swarm Algorithm

Optimization

Classification

Machine Learning

Data Mining

Evolutionary Computation

Swarm Intelligence

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.