Change-point Detection and Segmentation of Discrete Data using Bayesian Context Trees
Not on the map. Why?
Abstract (arXiv)
A new Bayesian modelling framework is introduced for piece-wise homogeneous variable-memory Markov chains, along with a collection of effective algorithmic tools for change-point detection and segmentation of discrete time series. Building on the recently introduced Bayesian Context Trees (BCT) framework, the distributions of different segments in a discrete time series are described as variable-memory Markov chains. Inference for the presence and location of change-points is then performed via Markov chain Monte Carlo sampling. The key observation that facilitates effective sampling is that, using one of the BCT algorithms, the prior predictive likelihood of the data can be computed exactly, integrating out all the models and parameters in each segment. This makes it possible to sample directly from the posterior distribution of the number and location of the change-points, leading to accurate estimates and providing a natural quantitative measure of uncertainty in the results. Estimates of the actual model in each segment can also be obtained, at essentially no additional computational cost. Results on both simulated and real-world data indicate that the proposed methodology performs better than or as well as state-of-the-art techniques.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 74 references that are in the map. First posted on arXiv 8 Mar 2022.
Builds on
4 of 74 references.
References · 4
- 2020An Evaluation of Change Point Detection Algorithmscited by 62
- 2020Bayesian Context Trees: Modelling and exact inference for discrete time seriescited by 12
- 2022Posterior Representations for Bayesian Context Trees: Sampling, Estimation and Convergencecited by 6
- 2013Universal Codes from Switching Strategiescited by 3
Built on by
Citing papers per year: 2023: 1.
1 paper.