Selecting a reduced set for building sparse support vector regression in the primal

Authors:
Liefeng Bo;Ling Wang;Licheng Jiao
Affiliations:
Institute of Intelligent Information Processing, Xidian University, Xi'an, China;Institute of Intelligent Information Processing, Xidian University, Xi'an, China;Institute of Intelligent Information Processing, Xidian University, Xi'an, China
Venue:
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2007

Citing 10
Cited 0

Making large-scale support vector machine learning practical

Advances in kernel methods
Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
Kernel Matching Pursuit

Machine Learning
Sparseness of support vector machines

The Journal of Machine Learning Research
A Modified Finite Newton Method for Fast Solution of Large Scale Linear SVMs

The Journal of Machine Learning Research
Working Set Selection Using Second Order Information for Training Support Vector Machines

The Journal of Machine Learning Research
Recursive Finite Newton Algorithm for Support Vector Regression in the Primal

Neural Computation
Training a Support Vector Machine in the Primal

Neural Computation
Building Support Vector Machines with Reduced Classifier Complexity

The Journal of Machine Learning Research
Input space versus feature space in kernel-based methods

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent work shows that Support vector machines (SVMs) can be solved efficiently in the primal. This paper follows this line of research and shows how to build sparse support vector regression (SVR) in the primal, thus providing for us scalable, sparse support vector regression algorithm, named SSVR-SRS. Empirical comparisons show that the number of basis functions required by the proposed algorithm to achieve the accuracy close to that of SVR is far less than the number of support vectors of SVR.