|
Trudy SPIIRAN, 2013, Issue 24, Pages 165–177
(Mi trspy583)
|
|
|
|
Decoding algorithm for binary linear hidden Markov models represented in the form of algebraic Bayesian networks
A. M. Alexeyeva, A. A. Filchenkovba, A. L. Tulupyevba a St. Petersburg State University, Department of Mathematics and Mechanics
b St. Petersburg Institute for Informatics and Automation of RAS
Abstract:
Probabilistic graphical models class including hidden Markov models and Bayesian networks proved to grant effective technique for representation of uncertainty in knowledge with actively developing theoretical and algorithmic apparatus; such models found many applications in the fields of speech recognition, signal processing, bioinformatics, natural language processing, digital forensics etc. The paper suggests a decoding algorithm for hidden states of binary linear hidden Markov models represented in the form of algebraic Bayesian networks; its correctness is proved. The presented algorithm completes the set of methods of such models.
Keywords:
probabilistic graphical models, hidden Markov models, algebraic Bayesian networks.
Received: 18.02.2013
Citation:
A. M. Alexeyev, A. A. Filchenkov, A. L. Tulupyev, “Decoding algorithm for binary linear hidden Markov models represented in the form of algebraic Bayesian networks”, Tr. SPIIRAN, 24 (2013), 165–177
Linking options:
https://www.mathnet.ru/eng/trspy583 https://www.mathnet.ru/eng/trspy/v24/p165
|
Statistics & downloads: |
Abstract page: | 261 | Full-text PDF : | 109 | References: | 48 | First page: | 1 |
|