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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.