On finite Newton method for support vector regression

  • Authors:
  • S. Balasundaram;Rampal Singh

  • Affiliations:
  • Jawaharlal Nehru University, School of Computer and Systems Sciences, New Delhi, India;University of Delhi, Department of Computer Science, DDUC, New Delhi, India

  • Venue:
  • Neural Computing and Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a Newton iterative method of solution for solving an ε-insensitive support vector regression formulated as an unconstrained optimization problem. The proposed method has the advantage that the solution is obtained by solving a system of linear equations at a finite number of times rather than solving a quadratic optimization problem. For the case of linear or kernel support vector regression, the finite termination of the Newton method has been proved. Experiments were performed on IBM, Google, Citigroup and Sunspot time series. The proposed method converges in at most six iterations. The results are compared with that of the standard, least squares and smooth support vector regression methods and of the exact solutions clearly demonstrate the effectiveness of the proposed method.