How to build your latent Markov model: The role of time and space
Sina Mews et al.
What the paper says
Statistical models that involve latent Markovian state processes have become immensely popular tools for analyzing time series and other sequential data. However, the plethora of model formulations, the inconsistent use of terminology and the various inferential approaches and software packages can be overwhelming to practitioners, especially when they are new to this area. With this review-like article, we thus aim to provide guidance for both statisticians and practitioners working with latent Markov models by offering a unifying view on what otherwise are often considered separate model classes, from hidden Markov models over state-space models to Markov-modulated Poisson processes. In particular, we provide a roadmap for identifying a suitable latent Markov model formulation given the data to be analyzed. Furthermore, we emphasize that it is key to applied work with any of these model classes to understand how recursive techniques exploiting the models’ dependence structure can be used for inference. The R package LaMa adapts this unified view and provides an easy-to-use framework for fast (C++ based) numerical maximum likelihood estimation of any of the models discussed in this article, allowing users to tailor a latent Markov model to their data using a Lego-type approach.
1 citation
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.16 × 0.4 = 0.06 |
| M · momentum | 0.53 × 0.15 = 0.08 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.