| Abstract: | We propose a solution to select promising subsets of autoregressive time series models for further consideration which follows up on the idea of the stochastic search variable selection procedure in George and McCulloch (1993). It is based on a Bayesian approach which is unconditional on the initial terms. The autoregression stepup is in the form of a hierarchical normal mixture model, where latent variables are used to identify the subset choice. The framework of our procedure is utilized by the Gibbs sampler, a Markov chain Monte Carlo method. The advantage of the method presented is computational: it is an alternative way to search over a potentially large set of possible subsets. The proposed method is illustrated with a simulated data as well as a real data. Copyright © 1999 John Wiley & Sons, Ltd. |
