Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

A fast Branch-and-Bound algorithm for U-curve feature selection

Full text
Author(s):
Atashpaz-Gargari, Esmaeil [1, 2] ; Reis, Marcelo S. [3] ; Braga-Neto, Ulisses M. [1, 4] ; Barrera, Junior [5] ; Dougherty, Edward R. [1, 4]
Total Authors: 5
Affiliation:
[1] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 - USA
[2] Natl Univ, Sch Engn & Comp, San Diego, CA - USA
[3] LECC, Inst Butantan, Ctr Toxins Immune Response & Cell Signaling CeTIC, Sao Paulo - Brazil
[4] TEES, Ctr Bioinformat & Genom Syst Engn, College Stn, TX - USA
[5] Univ Sao Paulo, Inst Math & Stat, Sao Paulo - Brazil
Total Affiliations: 5
Document type: Journal article
Source: PATTERN RECOGNITION; v. 73, p. 172-188, JAN 2018.
Web of Science Citations: 3
Abstract

We introduce a fast Branch-and-Bound algorithm for optimal feature selection based on a U-curve assumption for the cost function. The U-curve assumption, which is based on the peaking phenomenon of the classification error, postulates that the cost over the chains of the Boolean lattice that represents the search space describes a U-shaped curve. The proposed algorithm is an improvement over the original algorithm for U-curve feature selection introduced recently. Extensive simulation experiments are carried out to assess the performance of the proposed algorithm (IUBB), comparing it to the original algorithm (UBB), as well as exhaustive search and Generalized Sequential Forward Search. The results show that the IUBB algorithm makes fewer evaluations and achieves better solutions under a fixed computational budget. We also show that the IUBB algorithm is robust with respect to violations of the U-curve assumption. We investigate the application of the IUBB algorithm in the design of imaging W-operators and in classification feature selection, using the average mean conditional entropy (MCE) as the cost function for the search. (C) 2017 Elsevier Ltd. All rights reserved. (AU)

FAPESP's process: 13/07467-1 - CeTICS - Center of Toxins, Immune-Response and Cell Signaling
Grantee:Hugo Aguirre Armelin
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 15/01587-0 - Storage, modeling and analysis of dynamical systems for e-Science applications
Grantee:João Eduardo Ferreira
Support Opportunities: Research Grants - eScience and Data Science Program - Thematic Grants