Learning SVM kernel with semi-definite programming

Authors:
Shuzhong Yang;Siwei Luo
Affiliations:
School of Computer and Information Technology, Beijing Jiaotong University, Beijing, China;School of Computer and Information Technology, Beijing Jiaotong University, Beijing, China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part I
Year:
2005

Citing 7
Cited 0

The nature of statistical learning theory

The nature of statistical learning theory
Semidefinite programming

SIAM Review
Nonlinear component analysis as a kernel eigenvalue problem

Neural Computation
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
A Support Vector Machine with a Hybrid Kernel and Minimal Vapnik-Chervonenkis Dimension

IEEE Transactions on Knowledge and Data Engineering
Learning the Kernel Matrix with Semidefinite Programming

The Journal of Machine Learning Research
A comparison of methods for multiclass support vector machines

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well-known that the major task of the SVM approach lies in the selection of its kernel. The quality of kernel will determine the quality of SVM classifier directly. However, the best choice of a kernel for a given problem is still an open research issue. This paper presents a novel method which learns SVM kernel by transforming it into a standard semi-definite programming (SDP) problem and then solves this SDP problem using various existing methods. Experimental results are presented to prove that SVM with the kernel learned by our proposed method outperforms that with a single common kernel in terms of generalization power.