Robustifying the Viterbi algorithm

DOI10.1007/978-3-319-11433-0_11zbMATH Open1450.62099OpenAlexW2131585806MaRDI QIDQ2938403FDOQ2938403

Authors: Cedric de Boom, Jasper De Bock, Arthur van Camp, Gert De Cooman 

Publication date: 14 January 2015

Published in: Probabilistic Graphical Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11433-0_11

Recommendations

• An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models
• On the accuracy of the MAP inference in HMMs
• scientific article; zbMATH DE number 1099037
• A Viterbi smoother for discrete state space model
• Viterbi algorithms for hidden semi-Markov models with application to DNA analysis

zbMATH Keywords

Viterbi algorithmrobustnessmaximalityhidden state sequenceimprecise hidden Markov model

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Probabilistic graphical models (62H22)

Cited In (11)

• \texttt{CarpeDiem}: optimizing the Viterbi algorithm and applications to supervised sequential learning
• Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
• An approach to active sensing using the Viterbi algorithm
• Infinite Viterbi alignments in the two state hidden Markov models
• A coarse-to-fine approach to computing the \(k\)-best Viterbi paths
• Marginalized Viterbi algorithm for hierarchical hidden Markov models
• Viterbi algorithms for hidden Markov models with partially visible states
• On the accuracy of the MAP inference in HMMs
• Computation of the entropy of fuzzy hidden Markov chain
• Extended Viterbi algorithm for hidden Markov process: a transient/steady probabilities approach
• Thirty years of credal networks: specification, algorithms and complexity

This page was built for publication: Robustifying the Viterbi algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938403)