Name
Abstract | ||
|---|---|---|
In this contribution we derive a computational Bayesian approach to NARMAX model identification. The identification algorithm exploits continuing advances in computational processing power to numerically obtain posterior distributions for both model structure and parameters via sampling methods. The main advantage of this approach over other NARMAX identification algorithms is that for the first time model uncertainty is characterised as a byproduct of the identification procedure. The algorithm is based on the reversible jump Markov chain Monte Carlo (RJMCMC) procedure. Key features of the approach are (i) sampling of unselected model terms for testing for inclusion in the model (the birth move), which encourages global searching of the model term space, (ii) sampling of previously selected model terms for testing for exclusion from the model-a naturally incorporated pruning step (the death move), which leads to model parsimony, and (iii) estimation of model and parameter distributions, which are naturally generated in the Bayesian framework. We present a numerical example to demonstrate the algorithm and a comparison with a forward regression method: the results show that the RJMCMC approach is competitive and gives useful additional information regarding uncertainty in both model parameters and structure. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.automatica.2013.05.023 | Automatica |
Keywords | Field | DocType |
Model selection,System identification,NARMAX,Bayesian | Mathematical optimization,Computer science,Model selection,Reversible-jump Markov chain Monte Carlo,Time model,Sampling (statistics),System identification,Forward regression,Bayesian probability | Journal |
Volume | Issue | ISSN |
49 | 9 | 0005-1098 |
Citations | PageRank | References |
13 | 0.98 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tara Baldacchino | 1 | 24 | 2.73 |
| Sean R. Anderson | 2 | 89 | 14.87 |
| Visakan Kadirkamanathan | 3 | 431 | 62.00 |