A binary cuckoo search and its application for feature selection

• Main Author: Pereira, L. A.M. [UNESP]
• Publication Date: 2014
• Other Authors: Rodrigues, D. [UNESP], Almeida, T. N.S. [UNESP], Ramos, C. C.O., Souza, A. N. [UNESP], Yang, X. S., Papa, J. P. [UNESP]
• Format: Article
• Language: eng
• Source: Repositório Institucional da UNESP
• Download full: http://dx.doi.org/10.1007/978-3-319-02141-6_7; http://hdl.handle.net/11449/172550
• topic: Cuckoo search algorithm; Feature selection; Meta-heuristic algorithms; Optimum-path forest; Pattern classification

In classification problems, it is common to find datasets with a large amount of features, some of theses features may be considered as noisy. In this context, one of the most used strategies to deal with this problem is to perform a feature selection process in order to build a subset of features that can better represents the dataset. As feature selection can be modeled as an optimization problem, several studies have to attempted to use nature-inspired optimization techniques due to their large generalization capabilities. In this chapter, we use the Cuckoo Search (CS) algorithm in the context of feature selection tasks. For this purpose, we present a binary version of the Cuckoo Search, namely BCS, as well as we evaluate it with different transfer functions that map continuous solutions to binary ones. Additionally, the Optimum-Path Forest classifier accuracy is used as the fitness function. We conducted simulations comparing BCS with binary versions of the Bat Algorithm, Firefly Algorithm and Particle Swarm Optimization. BCS has obtained reasonable results when we consider the compared techniques for feature selection purposes. © 2014 Springer International Publishing Switzerland.