Location of Repository

An adaptive orthogonal search algorithm for model subset selection and non-linear system identification \ud

By H.L. Wei and S.A. Billings

Abstract

A new adaptive orthogonal search (AOS) algorithm is proposed for model subset selection and non-linear system identification. Model structure detection is a key step in any system identification problem. This consists of selecting significant model terms from a redundant dictionary of candidate model terms, and determining the model complexity (model length or model size). The final objective is to produce a parsimonious model that can well capture the inherent dynamics of the underlying system. In the new AOS algorithm, a modified generalized cross-validation criterion, called the adjustable prediction error sum of squares (APRESS), is introduced and incorporated into a forward orthogonal search procedure. The main advantage of the new AOS algorithm is that the mechanism is simple and the implementation is direct and easy, and more importantly it can produce efficient model subsets for most non-linear identification problems

Publisher: Taylor & Francis
Year: 2008
OAI identifier: oai:eprints.whiterose.ac.uk:8555

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.