Home > Research > Publications & Outputs > Exact and efficient Bayesian inference for mult...

Electronic data

Links

Text available via DOI:

View graph of relations

Exact and efficient Bayesian inference for multiple changepoint problems.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Exact and efficient Bayesian inference for multiple changepoint problems. / Fearnhead, Paul.
In: Statistics and Computing, Vol. 16, No. 2, 06.2006, p. 203-213.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Fearnhead P. Exact and efficient Bayesian inference for multiple changepoint problems. Statistics and Computing. 2006 Jun;16(2):203-213. doi: 10.1007/s11222-006-8450-8

Author

Fearnhead, Paul. / Exact and efficient Bayesian inference for multiple changepoint problems. In: Statistics and Computing. 2006 ; Vol. 16, No. 2. pp. 203-213.

Bibtex

@article{fdea94044268490da6fda0bf2aa804cc,
title = "Exact and efficient Bayesian inference for multiple changepoint problems.",
abstract = "We demonstrate how to perform direct simulation from the posterior distribution of a class of multiple changepoint models where the number of changepoints is unknown. The class of models assumes independence between the posterior distribution of the parameters associated with segments of data between successive changepoints. This approach is based on the use of recursions, and is related to work on product partition models. The computational complexity of the approach is quadratic in the number of observations, but an approximate version, which introduces negligible error, and whose computational cost is roughly linear in the number of observations, is also possible. Our approach can be useful, for example within an MCMC algorithm, even when the independence assumptions do not hold. We demonstrate our approach on coal-mining disaster data and on well-log data. Our method can cope with a range of models, and exact simulation from the posterior distribution is possible in a matter of minutes.",
keywords = "Bayes factor - Forward-backward algorithm - Model choice - Perfect simulation - Reversible jump MCMC - Well-log data",
author = "Paul Fearnhead",
year = "2006",
month = jun,
doi = "10.1007/s11222-006-8450-8",
language = "English",
volume = "16",
pages = "203--213",
journal = "Statistics and Computing",
issn = "0960-3174",
publisher = "Springer Netherlands",
number = "2",

}

RIS

TY - JOUR

T1 - Exact and efficient Bayesian inference for multiple changepoint problems.

AU - Fearnhead, Paul

PY - 2006/6

Y1 - 2006/6

N2 - We demonstrate how to perform direct simulation from the posterior distribution of a class of multiple changepoint models where the number of changepoints is unknown. The class of models assumes independence between the posterior distribution of the parameters associated with segments of data between successive changepoints. This approach is based on the use of recursions, and is related to work on product partition models. The computational complexity of the approach is quadratic in the number of observations, but an approximate version, which introduces negligible error, and whose computational cost is roughly linear in the number of observations, is also possible. Our approach can be useful, for example within an MCMC algorithm, even when the independence assumptions do not hold. We demonstrate our approach on coal-mining disaster data and on well-log data. Our method can cope with a range of models, and exact simulation from the posterior distribution is possible in a matter of minutes.

AB - We demonstrate how to perform direct simulation from the posterior distribution of a class of multiple changepoint models where the number of changepoints is unknown. The class of models assumes independence between the posterior distribution of the parameters associated with segments of data between successive changepoints. This approach is based on the use of recursions, and is related to work on product partition models. The computational complexity of the approach is quadratic in the number of observations, but an approximate version, which introduces negligible error, and whose computational cost is roughly linear in the number of observations, is also possible. Our approach can be useful, for example within an MCMC algorithm, even when the independence assumptions do not hold. We demonstrate our approach on coal-mining disaster data and on well-log data. Our method can cope with a range of models, and exact simulation from the posterior distribution is possible in a matter of minutes.

KW - Bayes factor - Forward-backward algorithm - Model choice - Perfect simulation - Reversible jump MCMC - Well-log data

U2 - 10.1007/s11222-006-8450-8

DO - 10.1007/s11222-006-8450-8

M3 - Journal article

VL - 16

SP - 203

EP - 213

JO - Statistics and Computing

JF - Statistics and Computing

SN - 0960-3174

IS - 2

ER -