2007
DOI: 10.18637/jss.v023.i03
|View full text |Cite
|
Sign up to set email alerts
|

bcp: AnRPackage for Performing a Bayesian Analysis of Change Point Problems

Abstract: Barry and Hartigan (1993) propose a Bayesian analysis for change point problems. We provide a brief summary of selected work on change point problems, both preceding and following Barry and Hartigan. We outline Barry and Hartigan's approach and offer a new R package, bcp (Erdman and Emerson 2007), implementing their analysis. We discuss two frequentist alternatives to the Bayesian analysis, the recursive circular binary segmentation algorithm (Olshen and Venkatraman 2004) and the dynamic programming algorithm … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
228
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 276 publications
(229 citation statements)
references
References 15 publications
1
228
0
Order By: Relevance
“…The presence and timing of change points in the macroalgal cover time series, indicative of a regime shift, were calculated via Bayesian change-point analysis (48). The analysis provides estimates of posterior probabilities for the presence of a change point at any given date and of posterior mean algal cover.…”
Section: Methodsmentioning
confidence: 99%
“…The presence and timing of change points in the macroalgal cover time series, indicative of a regime shift, were calculated via Bayesian change-point analysis (48). The analysis provides estimates of posterior probabilities for the presence of a change point at any given date and of posterior mean algal cover.…”
Section: Methodsmentioning
confidence: 99%
“…The double mass curve, Pettitt's test and the BCP analysis were used to detect a change point in observed runoff time series in this study. Furthermore, the BCP package developed by Erdman and Emerson [48] on R was used.…”
Section: Detection Of a Change Pointmentioning
confidence: 99%
“…The prior distribution of µ ij (the mean of the block beginning at position i + 1 and ending at position j) is chosen as N (µ 0 , σ 2 0 /(j − i)). The algorithm uses a partition ρ = (U 1 , U 2 , ..., U n ), where U i = 1 indicates a change point at position i + 1; Erdman and Emerson (2007) initialize U i to 0 for all i < n, with U n ≡ 1. In each step of the Markov chain, at each position i, a value of Ui is drawn from the conditional distribution of Ui given the data and the current partition.…”
Section: Methodological Approachmentioning
confidence: 99%