Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Implied distributions in multiple change point problems

Tools
- Tools
+ Tools

Aston, John A. D., Peng, Jyh-Ying and Martin, D. E. K.. (2012) Implied distributions in multiple change point problems. Statistics and Computing, Vol.22 (No.4). pp. 981-993. ISSN 0960-3174

This is the latest version of this item.

[img]
Preview
Text
WRAP_Aston_0770262-st-081111-change_points_dists.pdf - Accepted Version

Download (402Kb)
Official URL: http://dx.doi.org/10.1007/s11222-011-9268-6

Abstract

A method for efficiently calculating exact marginal, conditional and joint distributions for change points defined by general finite state Hidden Markov Models is proposed. The distributions are not subject to any approximation or sampling error once parameters of the model have been estimated. It is shown that, in contrast to sampling methods, very little computation is needed. The method provides probabilities associated with change points within an interval, as well as at specific points.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science > Statistics
Library of Congress Subject Headings (LCSH): Change-point problems
Journal or Publication Title: Statistics and Computing
Publisher: Springer
ISSN: 0960-3174
Date: 30 July 2012
Volume: Vol.22
Number: No.4
Page Range: pp. 981-993
Identification Number: 10.1007/s11222-011-9268-6
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: Engineering and Physical Sciences Research Council (EPSRC), Higher Education Funding Council for England (HEFCE), National Science Foundation (U.S.) (NSF)
Grant number: EP/H016856/1 (EPSRC), DMS-0805577 (NSF)
References: Albert, J. H. and S. Chib (1993). Bayes inference via Gibbs sampling of autoregressive time series subject to Markov mean and variance shifts. Journal of Business and Economic Statistics 11, 1–15. Aston, J. A. D. and D. E. K. Martin (2007). Distributions associated with general runs and patterns in hidden Markov models. Annals of Applied Statistics 1, 585–611. Balakrishnan, N. and M. Koutras (2002). Runs and Scans with Applications. New York: Wiley. Barry, D. and J. A. Hartigan (1992). Product partition models for change point problems. Annals of Statistics 20, 260–279. Barry, D. and J. A. Hartigan (1993). A Bayesian analysis for change-point problems. Journal of the American Statistical Association 88, 309–319. Billio, M. and A. Monfort (1998). Switching state space models: Likelihood functions, filtering and smoothing. Journal of Statistical Planning and Inference 68, 65–103. Capp´e, O., E. Moulines, and T. Ryd´en (2005). Inference in Hidden Markov Models. Springer. Carpenter, J., P. Clifford, and P. Fearnhead (1999). An improved particle filter for non-linear problems. IEE proceedings - Radar, Sonar and Navigation 146, 2–7. Chib, S. (1998). Estimation and comparison of multiple change-point models. Journal of Econometrics 86, 221–241. Durbin, R., S. Eddy, A. Krogh, and G. Mitchison (1998). Biological Sequence Analysis. Cambridge University Press. Eddy, S. R. (2004). What is a hidden Markov model? Nature Biotechnology 22, 1315–1316. Fearnhead, P. (2006). Exact and efficient Bayesian inference for multiple changepoint problems. Statistics and Computing 16, 203–213. Fearnhead, P. and Z. Liu (2007). Online inference for multiple changepoint problems. Journal of the Royal Statistical Society, Series B 69, 589–605. Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Volume 1. John Wiley & Sons. Fr¨uhwirth-Schnatter, S. (2006). Finite Mixture and Markov Switching Models. Springer. Fu, J. C. and M. V. Koutras (1994). Distribution theory of runs: A Markov chain approach. Journal of the American Statistical Association 89, 1050–1058. Gu´edon, Y. (2007). Exploring the state sequence space for hidden Markov and semi-Markov chains. Computational Statistics and Data Analysis 51, 2379–2409. Gu´edon, Y. (2008). Exploring the segmentation space for the assessment of multiple changepoint models. Technical Report 6619, INRIA. Hamilton, J. D. (1989). A new approach to the economic analysis of nonstationary time series and the business cycle. Econometrica 57, 357–384. Juang, B. H. and L. R. Rabiner (1991). Hidden Markov models for speech recognition. Technometrics 33, 251–272. Kim, C.-J. (1994). Dynamic linear models with Markov-switching. Journal of Econometrics 60, 1–22. Kschischang, F. R., B. J. Frey, and H.-A. Loeliger (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47, 498–519. MacDonald, I. L. and W. Zucchini (1997). Hidden Markov and Other Models for Discretevalued Time Series. London, UK: Chapman & Hall. Martin, A. D., K. M. Quinn, and J. H. Park (2011). MCMCpack: Markov Chain Monte Carlo in R. Journal of Statistical Software 42(9), 1–22. R Development Core Team (2011). R: A Language and Environment for Statistical Computing. Vienna, Austria: R Foundation for Statistical Computing. ISBN 3-900051-07-0. Rabiner, L. R. (1989). A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 77, 257–286. Sims, C. A. and T. Zha (2006). Were there regime switches in US monetary policy? American Economic Review 96, 54–81. Viterbi, A. (1967). Error bounds for convolution codes and an asymptotically optimal decoding algorithm. IEEE Transactions on Information Theory 13, 260–269.
URI: http://wrap.warwick.ac.uk/id/eprint/39099

Request changes to a record

Available Versions of this Item

  • Implied distributions in multiple change point problems. (deposited 12 Jul 2011 16:05)
    • Implied distributions in multiple change point problems. (deposited 08 Nov 2011 10:03) [Currently Displayed]

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us