This report studies when and why two Hidden Markov Models (HMMs) may represent the same stochastic process. HMMs are characterized in terms of equivalence classes whose elements represent identical stochastic processes. This characterization yields polynomial time algorithms to detect equivalent HMMs. We also find fast algorithms to reduce HMMs to essentially unique and minimal canonical representations. The reduction to a canonical form leads to the definition of 'Generalized Markov Models' which are essentially HMMs without the positivity constraint on their parameters. We discuss how this generalization can yield more parsimonious representations of stochastic processes at the cost of the probabilistic interpretation of the model parameters.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6801 |
| Date | 01 January 1993 |
| Creators | Balasubramanian, Vijay |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 111 p., 339883 bytes, 1337526 bytes, application/octet-stream, application/pdf |
| Relation | AITR-1370 |
Page generated in 0.0011 seconds