On finite Newton method for support vector regression

被引:6
作者
Balasundaram, S. [1 ]
Singh, Rampal [2 ]
机构
[1] Jawaharlal Nehru Univ, Sch Comp & Syst Sci, New Delhi 110067, India
[2] Univ Delhi, DDUC, Dept Comp Sci, New Delhi, India
关键词
Newton method; Regression; Support vector machines; Time series; NEURAL-NETWORK MODEL; MACHINE CLASSIFICATION; ARIMA;
D O I
10.1007/s00521-010-0361-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a Newton iterative method of solution for solving an epsilon-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.
引用
收藏
页码:967 / 977
页数:11
相关论文
共 26 条
[1]  
[Anonymous], P KDD 2001 KNOWL DIS
[2]  
[Anonymous], P IEEE INNS ENNS INT
[3]  
[Anonymous], INT C NEUR NETW BRAI
[4]  
[Anonymous], 2000, NATURE STAT LEARNING, DOI DOI 10.1007/978-1-4757-3264-1
[5]  
[Anonymous], 2006, Introduction to Time Series and Forecasting
[6]  
BAO YK, 2005, P 4 INT C MACH LEARN, P18
[7]   A hybrid SARIMA. and support vector machines in forecasting the production values of the machinery industry in Taiwan [J].
Chen, Kuan-Yu ;
Wang, Cheng-Hua .
EXPERT SYSTEMS WITH APPLICATIONS, 2007, 32 (01) :254-264
[8]  
Christianini N., 2000, INTRO SUPPORT VECTOR, P189
[9]  
Demiriz A., SUPPORT VECTOR MACHI
[10]   Finite Newton method for Lagrangian support vector machine classification [J].
Fung, G ;
Mangasarian, OL .
NEUROCOMPUTING, 2003, 55 (1-2) :39-55