Efficient order selection algorithms for integer-valued ARMA processes
We consider the problem of model (order) selection for integer-valued autoregressive moving-average (INARMA) processes. A very efficient reversible jump Markov chain Monte Carlo (RJMCMC) algorithm is constructed for moving between INARMA processes of different orders. An alternative in the form of the EM algorithm is given for determining the order of an integer-valued autoregressive (INAR) process. Both algorithms are successfully applied to both simulated and real data sets. Copyright 2008 The Authors. Journal compilation 2008 Blackwell Publishing Ltd
Year of publication: |
2009
|
---|---|
Authors: | Enciso-Mora, VĂctor ; Neal, Peter ; Rao, T. Subba |
Published in: |
Journal of Time Series Analysis. - Wiley Blackwell, ISSN 0143-9782. - Vol. 30.2009, 1, p. 1-18
|
Publisher: |
Wiley Blackwell |
Saved in:
Saved in favorites
Similar items by person
-
MCMC for Integer-Valued ARMA processes
Neal, Peter, (2007)
-
Rao, T. Subba, (1983)
-
On the theory of bilinear time series models
Rao, T. Subba, (1981)
- More ...