Abstract
This paper presents a recursive prediction error algorithm which addresses the problem of computational complexity for on-line identification of hidden Markov models (HMMs). The particular class of HMMs considered has state-values which are clustered into groups. This allows a reformulation of the Markov model and results in a sub-optimal reduced order identification scheme. Actually, an exact definition of clustering is not discussed, rather, a general identification technique is presented for which the computational requirements are greatly reduced when the state-values are divided in some way into groups. The applicability to certain types of cluster patterns is tested via simulation studies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.