BBA: A binary bat algorithm for feature selection
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Outros Autores: | , , , , |
Tipo de documento: | Artigo de conferência |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1109/SIBGRAPI.2012.47 http://hdl.handle.net/11449/73832 |
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. |
id |
UNSP_27ad8069432d9fe187b49473ca919377 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/73832 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
BBA: A binary bat algorithm for feature selectionbat algorithmfeature selectionoptimum-path forestData setsExhaustive searchOptimization problemsOptimum-path forestsSelection techniquesWrapper approachFeature extractionForestryAlgorithmsAutomatic ControlOptimizationProblem SolvingTechniquesFeature 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.Department of Computing São Paulo State University, BauruNational Physical Laboratory, LondonDepartment of Computing São Paulo State University, BauruUniversidade Estadual Paulista (Unesp)National Physical LaboratoryNakamura, R. Y M [UNESP]Pereira, L. A M [UNESP]Costa, K. A. [UNESP]Rodrigues, D. [UNESP]Papa, João Paulo [UNESP]Yang, X. S.2014-05-27T11:27:18Z2014-05-27T11:27:18Z2012-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject291-297http://dx.doi.org/10.1109/SIBGRAPI.2012.47Brazilian Symposium of Computer Graphic and Image Processing, p. 291-297.1530-1834http://hdl.handle.net/11449/7383210.1109/SIBGRAPI.2012.472-s2.0-848723678319039182932747194Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengBrazilian Symposium of Computer Graphic and Image Processing0,213info:eu-repo/semantics/openAccess2024-04-23T16:11:34Zoai:repositorio.unesp.br:11449/73832Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-06T00:03:40.030148Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
BBA: A binary bat algorithm for feature selection |
title |
BBA: A binary bat algorithm for feature selection |
spellingShingle |
BBA: A binary bat algorithm for feature selection Nakamura, R. Y M [UNESP] 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 |
title_short |
BBA: A binary bat algorithm for feature selection |
title_full |
BBA: A binary bat algorithm for feature selection |
title_fullStr |
BBA: A binary bat algorithm for feature selection |
title_full_unstemmed |
BBA: A binary bat algorithm for feature selection |
title_sort |
BBA: A binary bat algorithm for feature selection |
author |
Nakamura, R. Y M [UNESP] |
author_facet |
Nakamura, R. Y M [UNESP] Pereira, L. A M [UNESP] Costa, K. A. [UNESP] Rodrigues, D. [UNESP] Papa, João Paulo [UNESP] Yang, X. S. |
author_role |
author |
author2 |
Pereira, L. A M [UNESP] Costa, K. A. [UNESP] Rodrigues, D. [UNESP] Papa, João Paulo [UNESP] Yang, X. S. |
author2_role |
author author author author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) National Physical Laboratory |
dc.contributor.author.fl_str_mv |
Nakamura, R. Y M [UNESP] Pereira, L. A M [UNESP] Costa, K. A. [UNESP] Rodrigues, D. [UNESP] Papa, João Paulo [UNESP] Yang, X. S. |
dc.subject.por.fl_str_mv |
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 |
topic |
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 |
description |
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. |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012-12-01 2014-05-27T11:27:18Z 2014-05-27T11:27:18Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
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 9039182932747194 |
url |
http://dx.doi.org/10.1109/SIBGRAPI.2012.47 http://hdl.handle.net/11449/73832 |
identifier_str_mv |
Brazilian Symposium of Computer Graphic and Image Processing, p. 291-297. 1530-1834 10.1109/SIBGRAPI.2012.47 2-s2.0-84872367831 9039182932747194 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Brazilian Symposium of Computer Graphic and Image Processing 0,213 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
291-297 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808129578075422720 |