Linear penalization Support Vector Machines for feature selection

14Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Support Vector Machines have proved to be powerful tools for classification tasks combining the minimization of classification errors and maximizing their generalization capabilities. Feature selection, however, is not considered explicitly in the basic model formulation. We propose a linearly penalized Support Vector Machines (LP-SVM) model where feature selection is performed simultaneously with model construction. Its application to a problem of customer retention and a comparison with other feature selection techniques demonstrates its effectiveness. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Miranda, J., Montoya, R., & Weber, R. (2005). Linear penalization Support Vector Machines for feature selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3776 LNCS, pp. 188–192). https://doi.org/10.1007/11590316_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free