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.
翻译:采用新的巴耶斯建模框架,用于小片同质可变分子马尔科夫链条,以及一套有效的算法工具,用于改变点探测和分离离散时间序列。在最近推出的巴伊西亚上下文树框架的基础上,不同区段在离散时间序列中的分布被描述为可变模马科夫链条。然后通过Markov链、Monte Carlo取样对变化点的存在和位置进行推论。便利有效取样的关键观察是,利用BCT算法之一,可以准确计算数据先前的预测可能性,将每个区段的所有模型和参数整合在一起。这样,就可以直接从变化点的数量和位置的后方分布中进行抽样,从而得出准确的估计数,并提供关于结果不确定性的自然量度。每个区段的实际模型的估算基本上没有额外的计算成本。模拟数据和现实世界数据的结果都表明,拟议方法的运行优于或好于状态技术。