A hybrid search method of wrapper feature selection by chaos particle swarm optimization and local search

Abstract

Finding a subset of features from a large dataset is a problem that arises in many fields of study. Since the increasing number of features has extended the computational cost of a system, it is necessary to design and implement a system with the least number of features. The purpose of feature selection is to find the best subset of features from the original ones. The result of the best selection is improving the computational cost and the accuracy of the prediction. A large number of algorithms have been proposed for feature subset selection. In this paper, we propose a wrapper feature selection algorithm for a classification that is based on chaos theory, binary particle swarm optimization, and local search. In the proposed algorithm, the nearest neighbor algorithm is used for the evaluation phase.