Quick aggregation of Markov chain functionals via stochastic complementation

TitleQuick aggregation of Markov chain functionals via stochastic complementation
Publication TypeConference Paper
Year of Publication1997
AuthorsDogancay, K., and V. Krishnamurthy
Conference NameAcoustics, Speech, and Signal Processing, 1997. ICASSP-97., 1997 IEEE International Conference on
Pagination63 -66 vol.1
Date Publishedapr.
Keywordsaggregated states, aggregation method, computational complexity, functional equations, grouping, hidden Markov models, Markov chain functionals, maximum likelihood estimation, maximum likelihood parameter, signal processing, state estimation, stochastic complementation
Abstract

The paper presents a quick and simplified aggregation method for a large class of Markov chain functionals based on the concept of stochastic complementation. Aggregation results in a reduction in the number of Markov states by grouping them into a smaller number of aggregated states, thereby producing a considerable saving on computational complexity associated with maximum likelihood parameter and state estimation for hidden Markov models. The importance of the proposed aggregation method stems from the ease with which Markov chains with a large number of states can be aggregated. Three Markov chain functionals which have widespread use are considered to illustrate the application of our aggregation method

URLhttp://dx.doi.org/10.1109/ICASSP.1997.599548
DOI10.1109/ICASSP.1997.599548

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia