2018
DOI: 10.1016/j.patcog.2017.08.013
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 24 publications
(28 citation statements)
references
References 13 publications
0
28
0
Order By: Relevance
“…Choosing the best set of features consists of comparing the minimum of all lattice chains. There are some NP-hard algorithms that find the absolute minimum [ 9 , 10 ]. There are also some heuristics that give approximate solutions such as Sequential Forward Selection (SFS) [ 11 ], which adds features progressively until it finds a local minimum, and Sequential Forward Floating Selection (SFFS) [ 11 ], which, at first, adds features, but after takes some of them out and adds others, trying to improve the first local minimum found.…”
Section: Introductionmentioning
confidence: 99%
“…Choosing the best set of features consists of comparing the minimum of all lattice chains. There are some NP-hard algorithms that find the absolute minimum [ 9 , 10 ]. There are also some heuristics that give approximate solutions such as Sequential Forward Selection (SFS) [ 11 ], which adds features progressively until it finds a local minimum, and Sequential Forward Floating Selection (SFFS) [ 11 ], which, at first, adds features, but after takes some of them out and adds others, trying to improve the first local minimum found.…”
Section: Introductionmentioning
confidence: 99%
“…As studied in Section 2.3.6, the U -curve problem is a search problem in a complete Boolean lattice (P(S), ⊆) embedded with a cost function c with the U -curve property. Moreover, it is known that there exist proposed optimal solutions for this problem such as [Ris et al, 2010], [Atashpaz-Gargari et al, 2013], [Reis, 2013] and [Atashpaz-Gargari et al, 2018]. Unfortunately, the U -curve problem is NP-hard so these approaches present exponential computational complexity.…”
Section: Methodsmentioning
confidence: 99%
“…In the literature, there are approaches that solve the U -curve problem and variations of this problem such as [Ris et al, 2010], [Atashpaz-Gargari et al, 2013], [Reis, 2013] and [Atashpaz-Gargari et al, 2018]. Furthermore, Reis et al [2017] present a practical framework for feature selection algorithms and cost functions, it was also used in this work as we will see later in Section 4.3.…”
Section: U-curve Phenomenonmentioning
confidence: 99%
See 2 more Smart Citations