引用本文:丁晓剑,赵银亮.无偏置支持向量回归优化问题.软件学报,2012,23(9):2336-2346
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 3933次   下载 6289 本文二维码信息
码上扫一扫!
分享到: 微信 更多
无偏置支持向量回归优化问题
丁晓剑1, 赵银亮2
1.信息系统工程重点实验室,江苏 南京 210007;2.西安交通大学 电子与信息工程学院,陕西 西安 710049
摘要:
为了研究偏置对支持向量回归(support vector regression,简称SVR)问题泛化性能的影响,首先提出了无偏置SVR(NBSVR)的优化问题及其对偶问题.推导出了NBSVR 优化问题全局最优解的必要条件,然后证明了SVR 的对偶问题只能得到NBSVR 对偶问题的次优解.同时提出了NBSVR 的有效集求解算法,并证明了它是线性收敛的.基于21 个标准数据集的实验结果表明,在对偶问题解空间上,有偏置支持向量回归算法只能得到无偏置支持向量回归算法的次优解,NBSVR 的均方根误差要低于SVR.NBSVR 的训练时间不仅低于SVR,而且对核参数变化不太敏感.
关键词:  偏置  支持向量回归  有效集  泛化性能
DOI:10.3724/SP.J.1001.2012.04150
分类号:
基金项目:国家自然科学基金(61173040)
Support Vector Regression Optimization Problem without Bias
DING Xiao-Jian1, ZHAO Yin-Liang2
1.Science and Technology on Information Systems Engineering Laboratory, Nanjing 210007, China;2.School of Electrical and Information Engineering, Xi’an Jiaotong University, Xi’an 710049, China
Abstract:
To study the role of bias in support vector regression (SVR), primal and dual optimization formulations of support vector regression optimization problem without bias (NBSVR) are proposed first, and the necessary condition of NBSVR optimization formulation’s global optima is presented and sub-optima solution of NBSVR dual problem has been proved for the dual problem of SVR then. An active set algorithm of dual optimization formulation without bias is proposed, and the linear convergence of the proposed algorithm has been proved. The experimental results on 21 benchmark datasets show that in the solution space of dual problem, SVR can only obtain the sub-optimal solution of NBSVR, the root mean square error (RMSE) of NBSVR tends to lower than SVR. The training time of NBSVR is not only less than SVR, but also less sensitive to kernel parameter.
Key words:  bias  support vector regression  active set  generalization ability