A Monte Carlo Markov chain algorithm for a class of mixture time series models
A Monte Carlo Markov chain algorithm for a class of mixture time series models
复制标题
DOI:
10.1007/s11222-009-9147-6
复制
发表时间:
2011-01-01
影响因子:
2.2
通讯作者:
So, Mike K. P.
中科院分区:
文献类型:
--
作者:
Lau, John W.;So, Mike K. P.
This article generalizes the Monte Carlo Markov Chain (MCMC) algorithm, based on the Gibbs weighted Chinese restaurant (gWCR) process algorithm, for a class of kernel mixture of time series models over the Dirichlet process. This class of models is an extension of Lo's (Ann. Stat. 12:351-357, 1984) kernel mixture model for independent observations. The kernel represents a known distribution of time series conditional on past time series and both present and past latent variables. The latent variables are independent samples from a Dirichlet process, which is a random discrete (almost surely) distribution. This class of models includes an infinite mixture of autoregressive processes and an infinite mixture of generalized autoregressive conditional heteroskedasticity (GARCH) processes.