Trabalho apresentado em evento
Optimizing feature selection through binary charged system search
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.
Universidade Estadual Paulista (Unesp)
Universidade de São Paulo (USP)
Faculdade Sudoeste Paulista
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.
Showing items related by title, author, creator and subject.
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 ...
Díaz-Alvarado, Felipe; UNIVERSIDAD DE CHILE (2019)Nowadays, the increase in the industrial production is causing environmental problems when appropriate planning and control are absent. To overcome this situation, the Eco- Industrial Parks (EIPs) arise as a new way to ...
Genetic algorithm optimization in drug design QSAR: Bayesian-regularized genetic neural networks (BRGNN) and genetic algorithm-optimized support vectors machines (GA-SVM) Fernandez, M.; Caballero, J.; Fernandez, L.; Sarai, A.