Least squares support vector machine based partially linear model identification

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A nonlinear identification method was proposed for a class of partially linear models (PLM) which consist of a linear component summed with a nonlinear component in nonlinear ARX form. The method extends the standard least squares support vector machine (LSSVM) by replacing the equality constraint in the standard LSSVM with a PLM model. To guarantee the uniqueness of the linear coefficients, we imposed an additional explicit constraint on the feature map instead of an implicit constraint on the regressor vectors. Therefore the resulting PLM is a generalized version of the original one. Two examples show the effectiveness of the presented method. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Li, Y. F., Li, J., Su, H. Y., & Chu, J. (2006). Least squares support vector machine based partially linear model identification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4113 LNCS-I, pp. 775–781). Springer Verlag. https://doi.org/10.1007/11816157_94

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free