.png){kind=icon}
返回
Pair-v-SVR: A Novel and Efficient Pairing nu-Support Vector Regression Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2016.2598182.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a novel and efficient pairing nu-support vector regression (pair-v-SVR) algorithm that combines successfully the superior advantages of twin support vector regression (TSVR) and classical e-SVR algorithms. In spirit of TSVR, the proposed pair-v-SVR solves two quadratic programming problems (QPPs) of smaller size rather than a single larger QPP, and thus has faster learning speed than classical e-SVR. The significant advantage of our pair-v-SVR over TSVR is the improvement in the prediction speed and generalization ability by introducing the concepts of the insensitive zone and the regularization term that embodies the essence of statistical learning theory. Moreover, pair-v-SVR has additional advantage of using parameter v for controlling the bounds on fractions of SVs and errors. Furthermore, the upper bound and lower bound functions of the regression model estimated by pair-v-SVR capture well the characteristics of data distributions, thus facilitating automatic estimation of the conditional mean and predictive variance simultaneously. This may be useful in many cases, especially when the noise is heteroscedastic and depends strongly on the input values. The experimental results validate the superiority of our pair-v-SVR in both training/prediction speed and generalization ability.
Keyword:
Noise heteroscedastic model
support vector machines (SVMs)
support vector regression
regression estimation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容