Abstract: Recently we introduced algorithms for the efficient processing of high-order hidden Markov models (HMMs) of fixed order into the literature. In this paper these techniques are generalised to also include mixed-order HMMs. This then allows first-order equivalents to be found for all HMMs, thereby providing a unifying base for reasoning about their properties. Specifically we provide formulations that separates the duration modelling and context modelling capabilities of high-order HMMs.
Publication Year: 2002
Publication Date: 2002-11-27
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot