By Topic

Adaptive model selection for polynomial NARX models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cantelmo, C. ; Dipt. di Elettron. e Inf., Politec. di Milano, Milano, Italy ; Piroddi, L.

Two algorithms are proposed for the adaptive model selection of polynomial non-linear autoregressive with exogenous variable (NARX) models. The recursive forward regression with pruning (RFRP) algorithm is based on a recursive orthogonal least-squares (ROLS) procedure and efficiently integrates model augmentation and pruning to reduce processing time whenever new data are available. The algorithm provides excellent model structure tracking compared to different OLS-based model selection policies. A less accurate but much faster algorithm that can be used for time-critical applications is the ROLS-LASSO. This algorithm uses a recursive version of the least absolute shrinkage and selection operator (LASSO) regularisation approach for structure selection. It features a recursive standardisation of the regressors and performs parameter estimation with ROLS. A sliding window data updating is here adopted for both algorithms, although the methods seamlessly generalise to exponential windowing with forgetting factor. Some simulation examples are provided to demonstrate the model tracking capabilities of the algorithms.

Published in:

Control Theory & Applications, IET  (Volume:4 ,  Issue: 12 )