ESFS: A new embedded feature selection method based on SFS

Abstract

Feature subset selection is an important subject when training classifiers in Machine Learning (ML) problems. Too many input features in a ML problem may lead to the so-called "curse of dimensionality", which describes the fact that the complexity of the classifier parameters adjustment during training increases exponentially with the number of features. Thus, ML algorithms are known to suffer from important decrease of the prediction accuracy when faced with many features that are not necessary. In this paper, we introduce a novel embedded feature selection method, called ESFS, which is inspired from the wrapper method SFS since it relies on the simple principle to add incrementally most relevant features. Its originality concerns the use of mass functions from the evidence theory that allows to merge elegantly the information carried by features, in an embedded way, and so leading to a lower computational cost than original SFS. This approach has successfully been applied to the emergent domain of emotion classification in audio signals.

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@inproceedings{Xiao2008ESFSAN, title={ESFS: A new embedded feature selection method based on SFS}, author={Zhongzhe Xiao and Emmanuel Dellandr{\'e}a and Weibei Dou and Liming Chen}, year={2008} }