On the accuracy of the MAP inference in HMMs
From MaRDI portal
Publication:340107
DOI10.1007/s11009-015-9443-xzbMath1351.60093OpenAlexW1985713861MaRDI QIDQ340107
Publication date: 11 November 2016
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-015-9443-x
Computational methods in Markov chains (60J22) Markov processes: estimation; hidden Markov models (62M05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)
Related Items
Regenerativity of Viterbi process for pairwise Markov models, Exponential forgetting of smoothing distributions for pairwise Markov models, Existence of infinite Viterbi path for pairwise Markov models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A decision-theoretic approach for segmental classification
- Asymptotic risks of Viterbi segmentation
- A correction to ``On approximation of smoothing probabilities for hidden Markov models
- On approximation of smoothing probabilities for hidden Markov models
- The adjusted Viterbi training for hidden Markov models
- Exponential forgetting and geometric ergodicity in hidden Markov models
- Inference in hidden Markov models.
- The most probable annotation problem in HMMs and its application to bioinformatics
- Multiresolution image classification by hierarchical modeling with two-dimensional hidden Markov models
- Infinite Viterbi alignments in the two state hidden Markov models
- Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Biological Sequence Analysis
- Hidden Markov processes
- A soft output hybrid algorithm for ML/MAP sequence estimation
- New Loss Functions in Bayesian Imaging
- A Constructive Proof of the Existence of Viterbi Processes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Hidden Markov models for bioinformatics