Explicit-Duration Markov Switching Models

被引:10
作者
Chiappa, Silvia [1 ,2 ]
机构
[1] Univ Cambridge, Stat Lab, Cambridge, England
[2] Microsoft Res Cambridge, Cambridge, England
来源
FOUNDATIONS AND TRENDS IN MACHINE LEARNING | 2014年 / 7卷 / 06期
关键词
D O I
10.1561/2200000054
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Markov switching models (MSMs) are probabilistic models that employ multiple sets of parameters to describe different dynamic regimes that a time series may exhibit at different periods of time. The switching mechanism between regimes is controlled by unobserved random variables that form a first-order Markov chain. Explicit-duration MSMs contain additional variables that explicitly model the distribution of time spent in each regime. This allows to define duration distributions of any form, but also to impose complex dependence between the observations and to reset the dynamics to initial conditions. Models that focus on the first two properties are most commonly known as hidden semi-Markov models or segment models, whilst models that focus on the third property are most commonly known as changepoint models or reset models. In this monograph, we provide a description of explicitduration modelling by categorizing the different approaches into three groups, which differ in encoding in the explicit-duration variables different information about regime change/reset boundaries. The approaches are described using the formalism of graphical models, which allows to graphically represent and assess statistical dependence and therefore to easily describe the structure of complex models and derive inference routines. The presentation is intended to be pedagogical, focusing on providing a characterization of the three groups in terms of model structure constraints and inference properties. The monograph is supplemented with a software package that contains most of the models and examples described(1). The material presented should be useful to both researchers wishing to learn about these models and researchers wishing to develop them further.
引用
收藏
页码:803 / 886
页数:84
相关论文
共 66 条
[1]  
Adams R. P., 2007, BAYESIAN ONLINE CHAN
[2]   NONLINEAR BAYESIAN ESTIMATION USING GAUSSIAN SUM APPROXIMATIONS [J].
ALSPACH, DL ;
SORENSON, HW .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1972, AC17 (04) :439-&
[3]  
Barber D., 2012, BAYESIAN REASONING M
[4]  
Barber D, 2006, J MACH LEARN RES, V7, P2515
[5]   Graphical Models for Time-Series [J].
Barber, David ;
Cemgil, A. Taylan .
IEEE SIGNAL PROCESSING MAGAZINE, 2010, 27 (06) :18-28
[6]  
Barbu VS, 2008, THEIR USE RELIABILIT
[7]  
Bishop C. M., 2006, PATTERN RECOGN
[8]  
Bracegirdle C., 2013, THESIS
[9]  
Bracegirdle Chris, 2011, P 14 INT C ART INT S, P190
[10]   Stylized facts of financial time series and hidden semi-Markov models [J].
Bulla, Jan ;
Bulla, Ingo .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2006, 51 (04) :2192-2209