Generalized Baum-Welch and Viterbi Algorithms Based on the Direct Dependency among Observations

The parameters of a hidden markov model (hmm) are transition and emis- sion probabilities. both can be estimated using the baum-welch algorithm. the process of discovering the sequence of hidden states, given the sequence of observations, is performed by the viterbi algorithm. in both baum-welch and viterbi algorithms, it is assumed that, given the states, the observations are independent from each other. in this paper, we first consider the direct dependency between consecutive observations in the hmm, and then use conditional independence relations in the context of a bayesian network which is a probabilistic graphical model for generalizing the baum-welch and viterbi algorithms. we compare the performance of the generalized algorithms with the commonly used ones in simulation studies for synthetic data. we finally apply these algorithms on real data sets which are related to biological and inflation data. we show that the generalized baum-welch andviterbi algorithms significantly outperform the conventional ones when sample sizes become larger.