A sparse Bayesian approach for joint feature selection and classifier learning


In this paper we present a new method for Joint Feature Selection and Classifier Learning using a sparse Bayesian approach. These tasks are performed by optimizing a global loss function that includes a term associated with the empirical loss and another one representing a feature selection and regularization constraint on the parameters. To minimize this function we use a recently proposed technique, the Boosted Lasso algorithm, that follows the regularization path of the empirical risk associated with our loss function. We develop the algorithm for a well known non-parametrical classification method, the relevance vector machine, and perform experiments using a synthetic data set and three databases from the UCI Machine Learning Repository. The results show that our method is able to select the relevant features, increasing in some cases the classification accuracy when feature selection is performed.

DOI: 10.1007/s10044-008-0130-1

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@article{Lapedriza2008ASB, title={A sparse Bayesian approach for joint feature selection and classifier learning}, author={{\`A}gata Lapedriza and Santi Segu{\'i} and David Masip and Jordi Vitri{\`a}}, journal={Pattern Analysis and Applications}, year={2008}, volume={11}, pages={299-308} }