Adaptive simplification of solution for support vector machine

Qing Li

doi:10.1016/j.patcog.2006.07.005

Return

Adaptive simplification of solution for support vector machine

2007-03-01

PRE

李晴 (Qing Li) *

Licheng Jiao

DOI：10.1016/j.patcog.2006.07.005

Original

Original request for help

Save

Abstract

En 中文

SVM has been receiving increasing interest in areas ranging from its original application in pattern recognition to other applications such as regression estimation due to its remarkable generalization performance. Unfortunately, SVM is currently considerably slower in test phase caused by number of the support vectors, which has been a serious limitation for some applications. To overcome this problem, we proposed an adaptive algorithm named feature vectors selection (FVS) to select the feature vectors from the support vector solutions, which is based on the vector correlation principle and greedy algorithm. Through the adaptive algorithm, the sparsity of solution is improved and the time cost in testing is reduced. To select the number of the feature vectors adaptively by the requirements, the generalization and complexity trade-off can be directly controlled. The computer simulations on regression estimation and pattern recognition show that FVS is a promising algorithm to simplify the solution for support vector machine. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Keywords:

support vector machine

simplification

vector correlation

feature vector

regression estimation

pattern recognition

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.