.png){kind=icon}
返回
Robust support vector regression in the primal
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2008.09.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The classical support vector regressions (SVRs) are constructed based on convex loss functions. Since non-convex loss functions to a certain extent own superiority to convex ones in generalization performance and robustness, we propose a non-convex loss function for SVR, and then the concave-convex procedure is utilized to transform the non-convex optimization to convex one. In the following, a Newton-type optimization algorithm is developed to solve the proposed robust SVR in the primal, which can not only retain the sparseness of SVR but also oppress outliers in the training examples. The effectiveness, namely better generalization, is validated through experiments on synthetic and real-world benchmark data sets. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Support vector regression
Non-convex loss function
Concave-convex procedure
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.8K
被引数:
3.0W
机构
暂无机构信息
引用论文
分享收藏
Training robust support vector machine with smooth Ramp loss in the primal space.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
查看更多内容