Equivalence of state representations for hidden Markov models
An example of an open problem for hidden Markov models (HMM) is the realization problem: given the string probabilities of finite length strings, find all HMM that realize these string probabilities. The realization problem can be split up into three subproblems. The first is the realizability problem: derive conditions for string probabilities to be realizable by an HMM. The second subproblem is the realization problem itself: given realizable string probabilities, find a corresponding HMM. The third subproblem concerns the question of finding all possible realizations that are equivalent to a given realization. The paper considers the equivalence problem for HMM. Section 2 introduces Moore and Mealy HMM and their quasi-forms and also describes a procedure to find a minimal quasi-Mealy model equivalent to a given positive model. Section 3 describes the complete set of equivalent Mealy models. Section 4 shows, that under certain conditions, the class of equivalent quasi-Moore HMM consists of only one element up to a permutation of the states and subsequently gives a description of the set of equivalent positive Moore models. Section 5 summarizes the results concerning the equivalence sets, and Section 6 compares the results with the linear Gaussian case. Section 7 draws some conclusions.
- Local equivalence problem in hidden Markov model
- Formal definitions equivalent for two dimensional hidden Markov models
- The complete realization problem for hidden Markov models: a survey and some new results
- The realization problem for hidden Markov models
- Linear optimal prediction and innovations representations of hidden Markov models.
- A new decision method for elementary algebra
- Approximation of stationary processes by hidden Markov models
- scientific article; zbMATH DE number 5150813 (Why is no real title available?)
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 3390604 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the Identifiability Problem for Functions of Finite Markov Chains
- The realization problem for hidden Markov models
- Efficient and effective learning of HMMs based on identification of hidden states
- Local equivalence problem in hidden Markov model
- Quantum hidden Markov models based on transition operation matrices
- A Posteriori Probability Distances Between Finite-Alphabet Hidden Markov Models
- Spectral simplicity of apparent complexity. I: The nondiagonalizable metadynamics of prediction
- Equivalence relations and inference for sparse Markov models
- Formal definitions equivalent for two dimensional hidden Markov models
- Robust and nonlinear control literature survey (No. 7)
- On the equivalence between standard and sequentially ordered hidden Markov models
This page was built for publication: Equivalence of state representations for hidden Markov models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2427474)