BBA: A binary bat algorithm for feature selection
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
27/05/2014
27/05/2014
01/12/2012
|
Resumo |
Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be in-viable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the bats behaviour, which has never been applied to this context so far. The wrapper approach combines the power of exploration of the bats together with the speed of the Optimum-Path Forest classifier to find the set of features that maximizes the accuracy in a validating set. Experiments conducted in five public datasets have demonstrated that the proposed approach can outperform some well-known swarm-based techniques. © 2012 IEEE. |
Formato |
291-297 |
Identificador |
http://dx.doi.org/10.1109/SIBGRAPI.2012.47 Brazilian Symposium of Computer Graphic and Image Processing, p. 291-297. 1530-1834 http://hdl.handle.net/11449/73832 10.1109/SIBGRAPI.2012.47 2-s2.0-84872367831 |
Idioma(s) |
eng |
Relação |
Brazilian Symposium of Computer Graphic and Image Processing |
Direitos |
closedAccess |
Palavras-Chave | #bat algorithm #feature selection #optimum-path forest #Data sets #Exhaustive search #Optimization problems #Optimum-path forests #Selection techniques #Wrapper approach #Feature extraction #Forestry #Algorithms #Automatic Control #Optimization #Problem Solving #Techniques |
Tipo |
info:eu-repo/semantics/conferencePaper |