Hands-On Markov Models with Python

Recap of 1D HMM

Let's recap how 1D HMMs work, which we discussed in the previous chapters of this book. We have seen that HMM is a just a process over Markov chains. At any point in time, an HMM is in one of the possible states, and the next state that the model will transition to depends on the current state and the transition probability of the model. 

Suppose that there are M = {1, 2, ..., M} possible states for HMM, and the transition probability of going from some state i to state j is given by a_i,j. For such a model, if at time t-1 the model is at state i, then at time t it would be in state j with a probability of a_i,j. This probability is known as the transition probability. Also, we have defined the observed variable in the model, ...