Soft-constrained Linear Programming Support Vector Regression for Nonlinear Black-box Systems Identification

Soft-constrained Linear Programming Support Vector Regression for Nonlinear Black-box Systems Identification

Zhao Lu (Tuskegee University, Tuskegee, USA) and Jing Sun (University of Michigan, USA)
Copyright: © 2008 |Pages: 11
DOI: 10.4018/978-1-59904-705-8.ch005
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

As an innovative sparse kernel modeling method, support vector regression (SVR) has been regarded as the state-of-the-art technique for regression and approximation. In the support vector regression, Vapnik developed the -insensitive loss function as a trade-off between the robust loss function of Huber and one that enables sparsity within the support vectors. The use of support vector kernel expansion provides us a potential avenue to represent nonlinear dynamical systems and underpin advanced analysis. However, in the standard quadratic programming support vector regression (QP-SVR), its implementation is more computationally expensive and enough model sparsity can not be guaranteed. In an attempt to surmount these drawbacks, this article focus on the application of soft-constrained linear programming support vector regression (LP-SVR) in nonlinear black-box systems identification, and the simulation results demonstrates that the LP-SVR is superior to QP-SVR in model sparsity and computational efficiency

Complete Chapter List

Search this Book:
Reset