Letters: On the stability and bias-variance analysis of sparse SVMs

Authors:
V. Vijaya Saradhi;Harish Karnick
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, India;Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, India
Venue:
Neurocomputing
Year:
2008

Citing 8
Cited 0

The nature of statistical learning theory

The nature of statistical learning theory
SSVM: A Smooth Support Vector Machine for Classification

Computational Optimization and Applications
Stability and generalization

The Journal of Machine Learning Research
Sparseness of support vector machines

The Journal of Machine Learning Research
Bias-Variance Analysis of Support Vector Machines for the Development of SVM-Based Ensemble Methods

The Journal of Machine Learning Research
Predictive low-rank decomposition for kernel methods

ICML '05 Proceedings of the 22nd international conference on Machine learning
Demonstrating the stability of support vector machines for classification

Signal Processing - Signal processing in UWB communications
Building Support Vector Machines with Reduced Classifier Complexity

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Stability and bias-variance analysis are two powerful tools to better understand learning algorithms. We use these tools to analyze a class of support vector machines (SVMs) that try to reduce classifier complexity. The motivation for doing this is to compare the original and modified SVMs on two behavioral dimensions (a) stability and (b) learning behavior. Our preliminary experimental results show that (i) the class of algorithms which reduce classifier complexity by reducing the number of support vectors (SVs) are potentially unstable and (ii) the learning behavior is quite similar to the original SVMs.