Binary butterfly optimization approaches for feature selection

doi:10.1016/j.eswa.2018.08.051

Return

Binary butterfly optimization approaches for feature selection

2019-02-01

316

PRE

Arora, Sankalap *

Anand, Priyanka

DOI：10.1016/j.eswa.2018.08.051

Original

Original request for help

Save

Abstract

En 中文

In this paper, binary variants of the Butterfly Optimization Algorithm (BOA) are proposed and used to select the optimal feature subset for classification purposes in a wrapper-mode. BOA is a recently proposed algorithm that has not been systematically applied to feature selection problems yet. BOA can efficiently explore the feature space for optimal or near-optimal feature subset minimizing a given fitness function. The two proposed binary variants of BOA are applied to select the optimal feature combination that maximizes classification accuracy while minimizing the number of selected features. In these variants, the native BOA is utilized while its continuous steps are bounded in a threshold using a suitable threshold function after squashing them. The proposed binary algorithms are compared with five state-of-the-art approaches and four latest high performing optimization algorithms. A number of assessment indicators are utilized to properly assess and compare the performance of these algorithms over 21 datasets from the UCI repository. The experimental results confirm the efficiency of the proposed approaches in improving the classification accuracy compared to other wrapper-based algorithms, which proves the ability of BOA algorithm in searching the feature space and selecting the most informative attributes for classification tasks. (C) 2018 Elsevier Ltd. All rights reserved.

Keywords:

Binary butterfly optimization algorithm

Butterfly optimization algorithm

Feature selection

Bio-inspired optimization

AI Summary

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