Efficient backward decoding of high-order hidden Markov models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- High-order extensions of the Double Chain Markov Model
- Statistical Inference for Probabilistic Functions of Finite State Markov Chains
- The double chain markov model
Cited in
(5)- A novel method for decoding any high-order hidden Markov model
- Baum's forward-backward algorithm revisited
- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
- Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models
- A hidden Markov model with dependence jumps for predictive modeling of multidimensional time-series
This page was built for publication: Efficient backward decoding of high-order hidden Markov models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733144)