Building Sparse Large Margin Classifiers

This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The added constraint explicitly controls the sparseness of the classifier and an approach is provided to solve the formulated problem. When considering the dual of this problem, it can be seen that building an SLMC is equivalent to constructing an SVM with a modified kernel function. Further analysis of this kernel function indicates that the proposed approach essentially finds a discriminating subspace that can be spanned by a small number of vectors, and in this subspace different classes of data are linearly well separated. Experimental results over several classification benchmarks show that in most cases the proposed approach outperforms the state-of-art sparse learning algorithms.

• Type: Conference
• Year: 2005
• Where: ICML
• Authors: Bernhard Schölkopf, Gökhan H. Bakir, Mingrui Wu
• Keywords: ICML 2005, Kernel Function, Machine Learning, Sparse Large Margin, Sparse Learning Algorithms