返回
Error tolerance based support vector machine for regression
DOI:10.1016/j.neucom.2010.10.002.png)
摘要
En 中文
Most existing online algorithms in support vector machines (SVM) can only grow support vectors. This paper proposes an online error tolerance based support vector machine (ET-SVM) which not only grows but also prunes support vectors. Similar to least square support vector machines (LS-SVM), ET-SVM converts the original quadratic program (QP) in standard SVM into a group of easily solved linear equations. Different from LS-SVM, ET-SVM remains support vectors sparse and realizes a compact structure. Thus, ET-SVM can significantly reduce computational time while ensuring satisfactory learning accuracy. Simulation results verify the effectiveness of the newly proposed algorithm. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Support vector machine (SVM)
Error tolerance based support vector machine (ET-SVM)
Online learning
Growing and pruning support vectors
Fast algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Gel‐permeation chromatographic studies of cellulose degradation. I. Treatment with hydrochloric acid
Sparse support vector regression based on orthogonal forward selection for the generalised kernel model
NEUROCOMPUTING
IF6.5
Real-time performance evaluation of the minimal radial basis function network for identification of time varying nonlinear systems用于时变非线性系统辨识的最小径向基函数网络的实时性能评估

