Identifying combinatorially symmetric hidden Markov models
From MaRDI portal
Abstract: We provide a sufficient criterion for the unique parameter identification of combinatorially symmetric Hidden Markov Models based on the structure of their transition matrix. If the observed states of the chain form a zero forcing set of the graph of the Markov model then it is uniquely identifiable and an explicit reconstruction method is given.
Recommendations
- Parameter redundancy and identifiability in hidden Markov models
- Identification of hidden Markov models -- uniform LLN-s
- Identifiability of hidden Markov information sources and their minimum degrees of freedom
- Generic identication of binary-valued hidden Markov processes
- Identifiability of parameters in latent structure models with many observed variables
Cites work
Cited in
(4)
This page was built for publication: Identifying combinatorially symmetric hidden Markov models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685891)