PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Support Vector Machines with constraints for sparsity in the primal parameters
Vanessa Gómez-Verdejo, Manel Martínez-Ramón, Jerónimo Arenas-Garcia, Harold Molina-Bulla and Miguel Lazaro-Gredilla
IEEE Transactions on Neural Networks Volume 22, Number 8, pp. 1269-1283, 2011.

Abstract

This paper introduces a new support vector machine (SVM) formulation to obtain sparse solutions in the primal SVM parameters, providing a new method for feature selection based on SVMs. This new approach includes additional constraints to the classical ones that drop the weights associated to those features that are likely to be irrelevant. A ν-SVM formulation has been used, where ν indicates the fraction of features to be considered. This paper presents two versions of the proposed sparse classifier, a 2-norm SVM and a 1-norm SVM, the latter having a reduced computational burden with respect to the first one. Additionally, an explanation is provided about how the presented approach can be readily extended to multiclass classification or to problems where groups of features, rather than isolated features, need to be selected. The algorithms have been tested in a variety of synthetic and real data sets and they have been compared against other state of the art SVM-based linear feature selection methods, such as 1-norm SVM and doubly regularized SVM. The results show the good feature selection ability of the approaches.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8828
Deposited By:Jerónimo Arenas-Garcia
Deposited On:21 February 2012