
A Comprehensive Guide to HSMM
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
More details
Other editions
Additional editions

Persons
Nathalie Peyrard is Senior Scientist at INRAE, Toulouse, France. Her research includes computational statistics in models with latent variables, with applications in ecology.
Benoîte de Saporta is Professor of Applied Mathematics at the University of Montpellier, France. Her research includes applied probability (Markov processes, optimal stochastic control) and statistics (inference for partially hidden processes).
Content
Introduction xi
Benoîte DE SAPORTA, Jean-Baptiste DURAND, Alain FRANC and Nathalie PEYRARD
Chapter 1 Monochain HSMM 1
Jean-Baptiste DURAND, Alain FRANC, Nathalie PEYRARD, Nicolas VERGNE and Irene VOTSI
1.1. Introduction 1
1.2. HSMM framework 2
1.2.1. Intuitive presentation with the Squirrel toy example 2
1.2.2. General HSMM framework 4
1.2.3. Standard HSMM 7
1.2.4. Explicit duration HMM 10
1.2.5. Hmm 11
1.3. Inferential topics for HSMMs 11
1.3.1. Likelihood evaluation 12
1.3.2. Asymptotic properties of the MLE 15
1.3.3. EM algorithm 16
1.3.4. Smoothing and filtering probabilities 19
1.3.5. State restoration 20
1.4. Two toy examples reappearing throughout the book 22
1.4.1. Squirrel toy example 22
1.4.2. Deer toy example 23
1.5. Reliability 24
1.5.1. Rate of occurrence of failures 25
1.5.2. Mean time to failure 26
1.6. Introducing mixed effects into HSMMs 27
1.6.1. Mixed HSMMs explained with the Squirrel example 28
1.6.2. Mixed effects for real-valued observations with the Deer example 32
1.6.3. Dynamic covariates: toward an alternative representation of HSMMs 33
1.6.4. Model selection issues for fixed and random effects 35
1.6.5. Mixed models in the HMM/HSMM literature 35
1.7. Conclusion/discussion 38
1.8. Notations 39
1.9. Acknowledgments 40
1.10. Appendix: EM algorithm for a monochain HMM 40
1.10.1. E step 41
1.10.2. M step 42
1.11. References 43
Chapter 2 Review of HSMM R and Python Softwares 47
Caroline BÉRARD, Marie-Josée CROS, Jean-Baptiste DURAND, Corentin LOTHODÉ, Sandra PLANCADE, Ronan TRÉPOS and Nicolas VERGNE
2.1. Introduction 47
2.2. Software around HSMMs: state of the art 48
2.2.1. R packages 49
2.2.2. Python packages 54
2.2.3. Other relevant software 57
2.3. Comparative overview: R and Python packages for HSMM 62
2.3.1. General comparison 62
2.3.2. Sojourn durations 63
2.3.3. Observations 65
2.4. Illustration of the use of two packages for the toy examples 66
2.4.1. Docker image 66
2.4.2. Python package edhsmm on toy model Squirrel 67
2.4.3. R package hhsmm on deers 71
2.5. Conclusion 75
2.6. References 75
Chapter 3 Multichain HMM 79
Hanna BACAVE, Jean-Baptiste DURAND, Alain FRANC, Nathalie PEYRARD, Sandra PLANCADE and Régis SABBADIN
3.1. Introduction 79
3.2. Different concepts of MHMM 81
3.2.1. General MHMM 81
3.2.2. MHMM with conditional independencies 83
3.2.3. Case 1 of MHMM-CI: 1to1-MHMM-CI 85
3.2.4. Case 2 of MHMM-CI: FHMM 88
3.3. Examples of models of class 1to1-MHMM-CI 90
3.3.1. Structures obtained by coupling 91
3.3.2. Applications 93
3.4. Metapopulation dynamics and MHMM 96
3.5. Parameter inference in MHMMs with the EM algorithm 98
3.5.1. Case of general MHMMs 100
3.5.2. Case of 1to1-MHMM-CI 100
3.5.3. Case of FHMM 105
3.5.4. MHMM parameterization for continuous observations 105
3.6. Approximate inference in MHMMs 106
3.6.1. State of the art of approximate inference for CHMMs 108
3.6.2. State of the art of approximate inference for FHMMs 110
3.7. Discussion and conclusion 111
3.8. Notations 113
3.9. References 114
Chapter 4 Multichain HSMM 117
Jean-Baptiste DURAND, Nathalie PEYRARD, Sandra PLANCADE and Régis SABBADIN
4.1. Multichain HSMM in literature 117
4.2. Formalization of an explicit duration coupled semi-Markov model with interaction at jump events 118
4.2.1. Definition based on literal hypotheses 119
4.2.2. Generative definition using a time indexed representation 119
4.2.3. Graphical representation 121
4.3. Definition of coupled SMM classes based on a time-indexed representation 122
4.3.1. Limitations of the (Z, E, R) representation 122
4.3.2. Hazard rate representation 123
4.3.3. Definition and formalization of a class of coupled standard SMMs 124
4.3.4. Extension to general semi-Markov property 132
4.3.5. Other uses of time-indexed representation 132
4.4. Extension of some MHMM classes to semi-Markov framework 133
4.4.1. Generative definition of MHSMM classes 133
4.4.2. Graphical representation of MHSMM classes 134
4.4.3. About inference 136
4.5. Discussion and conclusion 136
4.6. Notations 136
4.7. Appendix: proof of proposition 1 138
4.8. References 142
Chapter 5 The Forward-backward Algorithm with Matrix Calculus 143
Alain FRANC
5.1. Introduction 144
5.2. UHMDs, with elimination and marginalization algorithms 145
5.2.1. Un-normalized heterogeneous Markov-based distribution 145
5.2.2. Elimination algorithm 146
5.2.3. Marginalization algorithm 148
5.3. Complements on the complexity of elimination and marginalization algorithms for an UHMD 150
5.3.1. Multichain UHMD 151
5.3.2. Sparsity 152
5.3.3. Independence between chains in an UHMD 153
5.4. Hidden Markov model 154
5.4.1. Computing the probability of the observations 155
5.4.2. Smoothing and EM algorithm 156
5.4.3. Presentation of the general approach 157
5.4.4. Sparsity of the transition matrix 158
5.5. Multichain hidden Markov models 159
5.5.1. General MHMM 160
5.5.2. A hierarchy of models 162
5.5.3. Correspondence between hidden and observed variables: 1to1-MHMM-CI 163
5.6. Hidden semi-Markov models 166
5.6.1. General SMM as an MM in calendar time 167
5.6.2. General HSMM in calendar time 168
5.6.3. Computing the probability of the observations 169
5.6.4. Particular cases of HSMM 170
5.6.5. Explicit duration hidden Markov model 170
5.7. Multichain HSMM 172
5.7.1. 1to1-J-MHSMM-CI 172
5.7.2. Multichain ED-HMM with conditional independence 175
5.7.3. Different geometries of coupling 176
5.8. Conclusions and perspectives 176
5.9. Notations 178
5.10. Acknowledgments 179
5.11. Appendix: Viterbi algorithm and most likely state 179
5.11.1. UHMD in a commutative semi-ring 180
5.11.2. Setting the problem 181
5.11.3. Computing the probability of the most likely state 182
5.11.4. Recovering the most likely state 183
5.12. References 184
Chapter 6 Controlled Hidden Semi-Markov Models 185
Alice CLEYNEN, Benoîte DE SAPORTA, Orlane ROSSINI, Régis SABBADIN and Amélie VERNAY
6.1. Introduction 185
6.2. Markov decision processes 186
6.2.1. MDP definition 187
6.2.2. Control for MDPs 188
6.2.3. Partially observed Markov decision processes 194
6.2.4. Solution algorithms for MDPs and POMDPs 199
6.3. Piecewise deterministic Markov processes 200
6.3.1. PDMP definition 200
6.3.2. Impulse control for PDMPs 210
6.4. Controlled PDMPs as members of the MDP family 215
6.4.1. Controlled PDMPs as MDPs 216
6.4.2. Partially observed controlled PDMPs as POMDPs 220
6.5. Concluding remarks and open questions 222
6.5.1. Open questions in impulse control of PDMPs that might be tackled from the MDP perspective 222
6.5.2. Interesting questions in MDPs arising from converted PDMPs 223
6.6. Notations 223
6.7. Acknowledgments 225
6.8. References 226
List of Authors 231
Index 233
Introduction
Hidden Markov models (HMMs) were introduced in the 1960s by Baum and Petrie (1966), first in the case of discrete observations. They have become classical tools to analyze time series whose dynamics can be explained by those of a hidden process. The model is composed of two sets of random variables that are two linked dynamical stochastic processes: one hidden and one observed. This family of models was originally popularized by applications in speech recognition (Baker 1975) and later in other domains like genomics (Churchill 1989). In parallel, developments were achieved in computational statistics to make statistical estimation possible. At the beginning of the 1980s, it was observed that the Markovian assumption on hidden state dynamics was not satisfied in the context of speech recognition. Thus, different relaxations of this assumption were proposed, leading to explicit duration HMMs (Ferguson 1980, ED-HMMs), reformulated shortly after in their modern, more parsimonious form by Russell and Moore (1985). More general semi-Markov models were introduced by Murphy (2002), as an extension of so-called segment HMMs, which are themselves generalizations of ED-HMMs.
Concomitantly with those generalizations of HMMs leading progressively to HSMMs, focusing on refinements on how state and sojourn durations at the current jump depend on the same quantities as the previous jump, HMMs underwent developments on modeling dependencies between several interacting chains, which is the subject of Chapter 3 in this book. These developments were once again motivated by applications in speech or video processing and oriented toward two directions: representing coupling of (shared) hidden states through observations (Ghahramani and Jordan 1997) or directly coupling through states, keeping observations conditionally independent given their unique associated hidden state (Brand et al. 1997).
Markov processes are also a key concept in control problems, whenever stochastic effects have an impact on the dynamics of the system states, or on the efficiency of actions taken to control the system, or even on both aspects. To account for such stochastic effects, Markov decision processes were introduced in the 1950s (Bellman 1958). In cases where the system state cannot be observed directly, but only indirectly through stochastic functions of the state process as in HMMS, the appropriate formalism to address control is that of partially observed MDPs (POMDPs), introduced by Åström (1965). Actually, in such models, "states" in the sense of HMMS may never be observed but POMDPs encompass states and observations into a broader concept of partially observed states. Some extensions of control problems to partially observed semi-Markov dynamics were introduced in the 1990s (Puterman 1994); they are presented in this book under the more general framework of impulse controlled piecewise-deterministic Markov processes.
In parallel with these theoretical developments, the application fields of HSMMs have largely expanded. Speech recognition is less present nowadays but HSMMs have successfully been applied in numerous other domains. This is well illustrated in the introduction of the book by Yu (Yu 2016), where the author presents an overview of the main areas of application up to 2016, covering almost 40 fields. In recent years, HSMMs have been applied to activities recognition for humans (van Kuppevelt et al. 2019; Cavallo et al. 2022; Thornton et al. 2023) and animals (Ruiz-Suarez et al. 2022; Koslik et al. 2023), as well as eye-movement analysis (Olivier et al. 2022; Gao et al. 2023). Seismology (Pertsinidou et al. 2017), epidemiology (Touloupou et al. 2020), occupational health (Haji-Maghsoudi et al. 2021), cardiovascular disease screening (Oliveira et al. 2018), neurophysiology (Chakravarty et al. 2019), plant growth (Mészáros et al. 2020; Labadie et al. 2023) and ecology (Nicol et al. 2022) also exploited the flexibility of HSMMs. Controlled versions of HMM or HSMM have been recently applied to reliability and safety (Srinivasan and Parlikad 2014; Zhang and Revie 2016), path planning for automated vehicles (Bravo et al. 2019), healthcare (Skandari and Shechter 2021; Fatemi et al. 2022; Liu et al. 2022; Garcia et al. 2024; de Saporta et al. 2024) and health economics (Cao et al. 2016; Mohammadi et al. 2023).
This book is written by a consortium of French researchers as part of the project Hidden Semi-Markov Models: INference, Control and Applications (HSMM-Inca) funded by the French Agence Nationale de la Recherche (ANR, grant ANR-21-CE40-005). This consortium is a unique group of researchers with a long experience of statistics, probability, inference and control for temporal and spatial processes. It also has expertise on the modeling and inference of hidden dynamic processes in health, ecology and natural risks.
We have written this book to offer an accessible introduction to the framework of HSMMs, covering the main methods and theoretical results for maximum likelihood estimation in HSMMs, together with an opening onto new, less classical related topics such as multichain HSMM and controlled HSMM. This book unifies and generalizes existing results. It is also complementary to more detailed textbooks such as Barbu and Limnios (2009) and Yu (2016) that go deeper into technical details but stay focused on classical HSMM.
This book is primarily intended for master and PhD students, researchers and academic faculty in the fields of statistics, applied probability, graphical models, computer science and connected domains. It is also meant to be accessible to practitioners involved in modeling, analysis or control of time series in the fields of reliability, theoretical ecology, signal processing, finance, medicine, epidemiology, etc.
The book is organized as follows. Chapter 1 introduces the general HSMM formalism and well-known particular cases. Then, it introduces maximum likelihood estimation (MLE) for HSMMs: likelihood expression and evaluation, asymptotic properties of the MLE and EM algorithm for MLE computation. Finally, it presents recent results on the definition of reliability indicators and an extensive review of how to introduce mixed effects into HSMM components.
Chapter 2 provides an overview of the packages and software (primarily in R and Python) dedicated to the estimation, simulation and application of HSMMs and other types of Markovian models that are central to the themes of the subsequent chapters.
Chapter 3 defines the framework of multichain HMM that enables us to present in a unified way existing models from literature and also generalize them. It illustrates how such models can be used to model dynamics in ecology and epidemiology. Then, it discusses inference of multichain HMM in the context of the EM algorithm.
Chapter 4 deals with the introduction of the semi-Markov assumption in multichain HMMs. It proposes a sound formalization of two classes of models that extend standard and general semi-Markov models to the multichain setting. Then, it considers the hidden framework and builds various classes of multichain HSMMs that generalize some MHMM structures defined in Chapter 3.
Chapter 5 focuses on the evaluation of the time complexity of marginal inference calculated with the forward-backward algorithm. It presents an algebraic formalism that leads to writing the forward-backward algorithm and calculating its complexity by counting the multiplications, with the same approach for several models studied in the previous chapters. It also shows how the sparsity of the transition matrices leads to a reduction of this complexity.
Chapter 6 focuses on controlled HSMMs. The chapter starts with a step-by-step introduction to the Markov decision processes (MDPs) formalism and progressively introduces partial observation semi-Markov assumption and continuous time to present the current available methods for controlled HSMMs.
This book presents distinct definitions, models and issues, which despite their differences share some common features. To guide the reader through this diversity of approaches, two simple case studies have been selected as toy examples, which are used during the course of the different chapters to illustrate the different notions and approaches, enabling an intuitive understanding before entering into the technique. They illustrate distinct extensions of HSMMs, like inference with covariates, multichain setting and linking with decision-making. The first one is referred to as Squirrel and the second as Deer. Both are models in behavioral ecology and introduced in Chapter 1. Chapters 2 and Chapter 6 present numerical illustrations of the two toy examples and provide the code for reproducing it.
Throughout the book, we also present open questions on the different aspects of HSMMs covered in the chapters. We hope we have created a source of inspiration for future research.
I.1. References
- Åström, K.J. (1965). Optimal control of Markov processes with incomplete state information. Journal of Mathematical Analysis and Applications, 10(1), 174-205.
- Baker, J. (1975). The DRAGON system - An overview. IEEE Transactions on Acoustics, Speech, and Signal Processing, 23(1), 24-29.
- Barbu, V.S. and Limnios, N. (2009)....
System requirements
File format: ePUB
Copy protection: Adobe-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Install the free reader Adobe Digital Editions prior to download (see eBook Help).
- Tablet/smartphone (Android; iOS): Install the free app Adobe Digital Editions or the app PocketBook before downloading (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (not Kindle).
The file format ePub works well for novels and non-fiction books – i.e., „flowing” text without complex layout. On an e-reader or smartphone, line and page breaks automatically adjust to fit the small displays.
This eBook uses Adobe-DRM, a „hard” copy protection. If the necessary requirements are not met, unfortunately you will not be able to open the eBook. You will therefore need to prepare your reading hardware before downloading.
Please note: We strongly recommend that you authorise using your personal Adobe ID after installation of any reading software.
For more information, see our ebook Help page.