Beam Search for Feature Selection

03/08/2022
by   Nicolas Fraiman, et al.
0

In this paper, we present and prove some consistency results about the performance of classification models using a subset of features. In addition, we propose to use beam search to perform feature selection, which can be viewed as a generalization of forward selection. We apply beam search to both simulated and real-world data, by evaluating and comparing the performance of different classification models using different sets of features. The results demonstrate that beam search could outperform forward selection, especially when the features are correlated so that they have more discriminative power when considered jointly than individually. Moreover, in some cases classification models could obtain comparable performance using only ten features selected by beam search instead of hundreds of original features.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2014

Online Group Feature Selection

Online feature selection with dynamic features has become an active rese...
research
06/14/2021

Determinantal Beam Search

Beam search is a go-to strategy for decoding neural sequence models. The...
research
05/31/2019

Efficient Forward Architecture Search

We propose a neural architecture search (NAS) algorithm, Petridish, to i...
research
11/16/2018

Beam Search Decoding using Manner of Articulation Detection Knowledge Derived from Connectionist Temporal Classification

Manner of articulation detection using deep neural networks require a pr...
research
07/25/2021

Identifying the fragment structure of the organic compounds by deeply learning the original NMR data

We preprocess the raw NMR spectrum and extract key characteristic featur...
research
06/12/2020

Generalizing Gain Penalization for Feature Selection in Tree-based Models

We develop a new approach for feature selection via gain penalization in...

Please sign up or login with your details

Forgot password? Click here to reset