\texttt{CarpeDiem}: optimizing the Viterbi algorithm and applications to supervised sequential learning

MaRDI QIDQ2880952zbMATH OpenFDO

Authors Roberto Esposito, Daniele P. Radicioni

Publication date 17 April 2012

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL http://www.jmlr.org/papers/v10/esposito09a.html

zbMATH Keywords

classifiers optimizationconditional modelsexact inferencesequence labelingViterbi algorithm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Robustifying the Viterbi algorithm
• Viterbi training in PRISM
• Hidden Markov models estimation via the most informative stopping times for the Viterbi algorithm
• Speeding up HMM decoding and training by exploiting sequence repetitions
• Handling ties correctly and efficiently in Viterbi training using the Viterbi semiring

Cited in

(4)

• Handling ties correctly and efficiently in Viterbi training using the Viterbi semiring
• CarpeDiem
• The Convex Mixture Distribution: Granger Causality for Categorical Time Series
• Quick Adaptive Ternary Segmentation: An Efficient Decoding Procedure For Hidden Markov Models

This page was built for publication: \texttt{CarpeDiem}: optimizing the Viterbi algorithm and applications to supervised sequential learning

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