2011
DOI: 10.1007/s11222-011-9268-6
|View full text |Cite
|
Sign up to set email alerts
|

Implied distributions in multiple change point problems

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(12 citation statements)
references
References 30 publications
0
12
0
Order By: Relevance
“…This definition generalizes the changepoint-out-of the regime k CP = 1, considered by Aston, Peng, and Martin (2011). Under this changepoint definition, the changepoint problem becomes a waiting time distribution problem for runs in the underlying state sequence.…”
Section: Exact Changepoint Distributionsmentioning
confidence: 97%
See 2 more Smart Citations
“…This definition generalizes the changepoint-out-of the regime k CP = 1, considered by Aston, Peng, and Martin (2011). Under this changepoint definition, the changepoint problem becomes a waiting time distribution problem for runs in the underlying state sequence.…”
Section: Exact Changepoint Distributionsmentioning
confidence: 97%
“…For overviews of HMMs, we refer the reader to MacDonald and Zucchini (1997) and Cappé, Moulines, and Rydén (2005). The use of HMMs provides a sophisticated modeling framework for a variety of problems and applications including changepoint analysis (e.g., Chib 1998;Aston, Peng, and Martin 2011) and thus forms one of the many building blocks in our proposed methodology. Within a HMM framework, we have the observation process {Y t } t≥1 which is dependent on an underlying latent finite state Markov chain (MC), {X t } t≥0 ∈ X with | X | < ∞.…”
Section: Statistical Backgroundmentioning
confidence: 99%
See 1 more Smart Citation
“…Much of the inference and applications for HMMs such as estimating the underlying state sequence (Viterbi, 1967), parameter estimation (Baum et al, 1970) and changepoint inference (Chib (1998), Aston et al (2011), Nam et al (2012)), assume that the number of states the underlying Markov Chain (MC) can take, H, is known a priori. However, this is often not the case when presented with time series data.…”
Section: Introductionmentioning
confidence: 99%
“…The exact change point distributions computed via FMCI methodology (Aston et al. , 2011) already quantify the residual uncertainty given both the model parameters and the observed data.…”
Section: Introductionmentioning
confidence: 99%