Statistical Inference in Hidden Markov Models Using k -Segment Constraints

However, the reporting of output from HMMs has largely been restricted to the presentation of the most-probable (MAP) hidden state sequence, found via the Viterbi algorithm, or the sequence of most probable marginals using the forward–backward algorithm. In this article, we expand the amount of information we could obtain from the posterior distribution of an HMM by introducing linear-time dynamic programming recursions that, conditional on a user-specified constraint in the number of segments, allow us to (i) find MAP sequences, (ii) compute posterior probabilities, and (iii) simulate sample paths.

We collectively call these recursions k -segment algorithms and illustrate their utility using simulated and real examples. We also highlight the prospective and retrospective use of k -segment constraints for fitting HMMs or exploring existing model fits. Supplementary materials for this article are available online.