Simplified support vector machines via kernel-based clustering

Authors:
Zhi-Qiang Zeng;Ji Gao;Hang Guo
Affiliations:
Department of Computer Science and Engineering, Zhejiang University, Hangzhou, China;Department of Computer Science and Engineering, Zhejiang University, Hangzhou, China;Department of Computer Science and Engineering, Zhejiang University, Hangzhou, China
Venue:
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Year:
2006

Citing 5
Cited 0

Kernel PCA and de-noising in feature spaces

Proceedings of the 1998 conference on Advances in neural information processing systems II
On a Connection between Kernel PCA and Metric Multidimensional Scaling

Machine Learning
LIBSVM: A library for support vector machines

ACM Transactions on Intelligent Systems and Technology (TIST)
Input space versus feature space in kernel-based methods

IEEE Transactions on Neural Networks
The pre-image problem in kernel methods

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reduced set method is an important approach to speed up classification process of support vector machine (SVM) by compressing the number of support vectors included in the machine's solution. Existing works find the reduced set vectors based on solving an unconstrained optimization problem with multivariables, which may suffer from numerical instability or get trapped in a local minimum. In this paper, a novel reduced set method relying on kernel-based clustering is presented to simplify SVM solution. This approach is conceptually simpler, involves only linear algebra and overcomes the difficulties existing in former reduced set methods. Experiments on real data sets indicate that the proposed method is effective in simplifying SVM solution while preserving machine's generalization performance.