Decoding algorithm for binary linear hidden Markov models represented in the form of algebraic Bayesian networks
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.References
Published
2013-02-01
How to Cite
Tulupyev, A., Filchenkov, A., & Alexeyev, A. (2013). Decoding algorithm for binary linear hidden Markov models represented in the form of algebraic Bayesian networks. SPIIRAS Proceedings, 1(24), 165-177. https://doi.org/10.15622/sp.24.11
Section
Articles
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
