Actas de congresos
Optimizing feature selection through binary charged system search
Fecha
2013-09-26Registro en:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 8047 LNCS, n. PART 1, p. 377-384, 2013.
0302-9743
1611-3349
10.1007/978-3-642-40261-6_45
2-s2.0-84884491505
8212775960494686
Autor
Universidade Estadual Paulista (Unesp)
Universidade de São Paulo (USP)
Faculdade Sudoeste Paulista
Institución
Resumen
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 inviable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the Charged System Search (CSS), which has never been applied to this context so far. The wrapper approach combines the power of exploration of CSS 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 four public datasets have demonstrated the validity of the proposed approach can outperform some well-known swarm-based techniques. © 2013 Springer-Verlag.
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Real Options Approach to optimizing long term mine planning
Epstein Numhauser, Rafael David; UNIVERSIDAD DE CHILE (2003)This thesis uses a dynamic programming approach to sequence the extraction of different blocks of a mine when there is uncertainty on the spot price of the output of the mining activity. To select the parameters of such ... -
Real Options Approach to optimizing long term mine planning
Saure Valenzuela, Denis Roland -
NECESSARY AND SUFFICIENT OPTIMALITY CONDITIONS FOR CONTINOUS-TIME MULTIOBJECTIVE OPTIMIZATION PROBLEMS
Batista Dos Santos, Lucelina; Brandao, A J; De Oliveira, Valeriano Antunes; Rojas Medar, Marko Antonio