期刊
APPLIED MATHEMATICS AND COMPUTATION
卷 214, 期 2, 页码 329-335出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2009.04.010
关键词
Support vector machine; Vector correlation; Genetic algorithms; Optimal solution; Discriminant function; Pattern recognition
Being a universal learning machine, a support vector machine ( SVM) suffers from expensive computational cost in the test phase due to the large number of support vectors, and greatly impacts its practical use. To address this problem, we proposed an adaptive genetic algorithm to optimally reduce the solutions for an SVM by selecting vectors from the trained support vector solutions, such that the selected vectors best approximate the original discriminant function. Our method can be applied to SVMs using any general kernel. The size of the reduced set can be used adaptively based on the requirement of the tasks. As such the generalization/complexity trade-off can be controlled directly. The lower bound of the number of selected vectors required to recover the original discriminant function can also be determined. (C) 2009 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据