A new approach for the identification of hidden Markov models

Citations Over TimeTop 10% of 2007 papers

Abstract

In this paper, we consider the approximate identification problem for hidden Markov models, i.e. given a finite- valued output string generated by an unknown hidden Markov model, find an approximation of the underlying model. We propose a two-step procedure for the approximate identification problem. In the first step the underlying state sequence corresponding to the output sequence is estimated directly from the output data. In the second step the system matrices are calculated from the obtained state sequence and the given output sequence. In a simulation example the performance of our proposed method is compared with the performance of the classical Baum-Welch approach for identification of hidden Markov models.

Related Papers

• → A minimum discrimination information approach for hidden Markov modeling(2005)22 cited
• → Hidden Markov Model(2015)3 cited
• → A Novel Method for Decoding Any High-Order Hidden Markov Model(2014)5 cited
• Text Information Extraction Based on the Second-Order Hidden Markov Model(2007)
• Algorithms of Third-Order Hidden Markov Model and Its Relationship with First-Order Hidden Markov Model(2011)