Feature Selection with a Backtracking Search Optimization Algorithm

¹ Dept. of Cultural Technology and Communication University of the Aegean Mytilene, Greece
² Dept. of Cultural Technology and Communication University of the Aegean Mytilene, Greece

gtsek@aegean.gr
cti20004@ct.aegean.gr

Abstract

Feature selection carries significance in the outcome of any classification or regression task. Exercising evolutionary computation algorithms in feature selection has led to the construction of efficient discrete optimization algorithms. In this paper, a modified backtracking search algorithm is employed to perform wrapper-based feature selection, where two modifications of the standard backtracking search algorithm are adopted. The first one concentrates on utilizing a particle ranking operator regarding the current population. The second one focuses on removing the case of using a single particle on the mutation process. Then, the implementation of the above algorithm in feature selection is carried out in terms of two general frameworks, which originally were developed for the particle swarm optimization. The first framework is based on the binary and the second on the set-based particle swarm optimization. The experimental analysis shows that the above variants of the backtracking search algorithm perform equally well on the classification of several datasets.