计算机应用 ›› 2012, Vol. 32 ›› Issue (09): 2504-2507.DOI: 10.3724/SP.J.1087.2012.02504

• 人工智能 • 上一篇    下一篇

拉格朗日支持向量回归的有限牛顿算法

郑逢德*,张鸿宾   

  1. 北京工业大学 计算机学院,北京 100124
  • 收稿日期:2012-03-19 修回日期:2012-05-22 发布日期:2012-09-01 出版日期:2012-09-01
  • 通讯作者: 郑逢德
  • 作者简介:郑逢德(1980-),男,河南新乡人,博士研究生,主要研究方向:核方法、机器学习; 张鸿宾(1944-),男,教授,博士生导师,主要研究方向:模式识别、神经网络、数字水印。
  • 基金资助:

    国家自然科学基金资助项目(60775011)

Finite Newton algorithm for Lagrangian support vector regression

ZHENG Feng-de*,ZHANG Hong-bin   

  1. College of Computer Science,Beijing University of Technology,Beijing 100124,China
  • Received:2012-03-19 Revised:2012-05-22 Online:2012-09-01 Published:2012-09-01
  • Contact: Feng-De ZHENG

摘要: 拉格朗日支持向量回归是一种有效的快速回归算法,求解时需要对维数等于样本数加一的矩阵求逆,求解需要较多的迭代次数才能收敛。采用一种Armijo步长有限牛顿迭代算法求解拉格朗日支持向量回归的优化问题,只需有限次求解一组线性等式而不需要求解二次规划问题,该方法具有全局收敛和有限步终止的性质。在多个标准数据集上的实验验证了所提算法的有效性和快速性。

关键词: 支持向量回归, 拉格朗日支持向量机, 有限牛顿算法, 迭代算法

Abstract: Lagrangian Support Vector Regression (SVR) is an effective algorithm and its solution is obtained by taking the inverse of a matrix of order equaling the number of samples plus one, but needs many times to terminate from a starting point. This paper proposed a finite Armijo-Newton algorithm solving the Lagrangian SVR's optimization problem. A solution was obtained by solving a system of linear equations at a finite number of times rather than solving a quadratic programming problem. The proposed method has the advantage that the result optimization problem is solved with global convergence and finite-step termination. The experimental results on several benchmark datasets indicate that the proposed algorithm is fast, and shows good generalization performance.

Key words: Support Vector Regression (SVR), Lagrangian support vector machine, finite Newton algorithm, iterative algorithm

中图分类号: