Optimal Viterbi Bayesian predictive classification for data from finite alphabets

DOI10.1016/J.JSPI.2012.07.013MaRDI QIDQ1926540zbMATH OpenOpenAlexFDO

Authors Jukka Corander, Jie Xiong, Yaqiong Cui, Timo Koski

Publication date 28 December 2012

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jspi.2012.07.013

zbMATH Keywords

hidden Markov modelsBayesian learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Markov processes (60J99) Bayesian problems; characterization of Bayes procedures (62C10)

Recommendations

• Bayesian classification of hidden Markov models
• Optimal pattern recognition procedures and their application
• Have I seen you before? Principles of Bayesian predictive classification revisited
• A Bayesian classification approach with application to speech recognition
• A Bayesian approach for classification of Markov sources

Cited in

(7)

• scientific article; zbMATH DE number 2087258 (Why is no real title available?)
• Estimation of Viterbi path in Bayesian hidden Markov models
• Marginal and simultaneous predictive classification using stratified graphical models
• Handling ties correctly and efficiently in Viterbi training using the Viterbi semiring
• Simultaneous predictive Gaussian classifiers
• Have I seen you before? Principles of Bayesian predictive classification revisited
• MAP segmentation in Bayesian hidden Markov models: a case study

This page was built for publication: Optimal Viterbi Bayesian predictive classification for data from finite alphabets

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