A multi-objective artificial butterfly optimization approach for feature selection
Feature selection plays an essential role in machine learning since high dimensional real-world datasets are becoming more popular nowadays. The very basic idea consists in selecting a compact but representative set of features that reduce the computational cost and minimize the classification error...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2020 |
| País: | Brasil |
| Institución: | Universidade Estadual Paulista (UNESP) |
| Repositorio: | Repositório Institucional da UNESP |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.unesp.br:11449/201828 |
| Acceso en línea: | http://dx.doi.org/10.1016/j.asoc.2020.106442 http://hdl.handle.net/11449/201828 |
| Access Level: | acceso abierto |
| Palabra clave: | Machine learning Many-objective optimization Meta-heuristic algorithms Pattern recognition |
| Sumario: | Feature selection plays an essential role in machine learning since high dimensional real-world datasets are becoming more popular nowadays. The very basic idea consists in selecting a compact but representative set of features that reduce the computational cost and minimize the classification error. In this paper, the authors propose single, multi- and many-objective binary versions of the Artificial Butterfly Optimization (ABO) in the context of feature selection. The authors also propose two different approaches: (i) the first one (MO-I) aims at optimizing the classification accuracy of each class individually, while (ii) the second one (MO-II) considers the feature set minimization in the process either. The experiments were conducted over eight public datasets, and the proposed approaches are compared against the well-known Particle Swarm Optimization, Firefly Algorithm, Flower Pollination Algorithm, Brainstorm Optimization, and the Black Hole Algorithm. The results showed that the binary single-objective ABO performed better than the other meta-heuristic techniques, selecting fewer features and also figuring a lower computational burden. Concerning multi- and many-objective feature selection, both MO-I and MO-II approaches performed better than their single-objective meta-heuristic counterparts. |
|---|