The Community for Technology Leaders
Green Image
This paper adopts a Bayesian approach to simultaneously learn both an optimal nonlinear classifier and a subset of predictor variables (or features) that are most relevant to the classification task. The approach uses heavy-tailed priors to promote sparsity in the utilization of both basis functions and features; these priors act as regularizers for the likelihood function that rewards good classification on the training data. We derive an expectation-maximization (EM) algorithm to efficiently compute a maximum a posteriori (MAP) point estimate of the various parameters. The algorithm is an extension of recent state-of-the-art sparse Bayesian classifiers, which in turn can be seen as Bayesian counterparts of support vector machines. Experimental comparisons using kernel classifiers demonstrate both parsimonious feature selection and excellent classification accuracy on a range of synthetic and benchmark data sets.
Pattern recognition, statistical learning, feature selection, sparsity, support vector machines, relevance vector machines, sparse probit regression, automatic relevance determination, EM algorithm.

L. Carin, M. A. Figueiredo, B. Krishnapuram and A. J. Hartemink, "A Bayesian Approach to Joint Feature Selection and Classifier Design," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 26, no. , pp. 1105-1111, 2004.
79 ms
(Ver 3.3 (11022016))