Feature selection using Forest Optimization Algorithm

• FOA is adjusted for solving Feature Selection (FS) as a discrete search problem.
• The proposed FSFOA is compared with GA, PSO and ACO based methods.
• We investigated the performance of FSFOA on 11 well-known datasets from UCI.
• Results show improvement in classification accuracy of classifiers in some datasets.

Feature selection as a combinatorial optimization problem is an important preprocessing step in data mining; which improves the performance of the learning algorithms with the help of removing the irrelevant and redundant features. As evolutionary algorithms are reported to be suitable for optimization tasks, so Forest Optimization Algorithm (FOA) – which is initially proposed for continuous search problems – is adapted to be used for feature selection as a discrete search space problem. As the result, Feature Selection using Forest Optimization Algorithm (FSFOA) is proposed in this article in order to select the more informative features from the datasets. The proposed FSFOA is validated on several real world datasets and it is compared with some other methods including HGAFS, PSO and SVM-FuzCoc. The results of the experiments show that, FSFOA can improve the classification accuracy of classifiers in some selected datasets. Also, we have compared the dimensionality reduction of the proposed FSFOA with other available methods.