The evaluation problem in discrete semi-hidden Markov models

J.F. Gómez-Lopera, J. Martínez-Aroza, R. Román-Roldán, R. Román-Gálvez and D. Blanco-Navarro

Mathematics and Computers in Simulation (MATCOM), 2017, vol. 137, issue C, 350-365

Abstract: This paper is devoted to discrete semi-hidden Markov models (SHMM), which are related to the well-known hidden Markov models (HMM). In particular, the HMM associated to an SHMM is defined, and the forward algorithm for solving the evaluation problem in SHMMs is introduced. Experiments show that in a set of randomly generated sequences with different SHMMs, the maximum value for the conditional probability of each sequence being generated by the model most frequently matches the model that generated the sequence. Something similar happens to associated HMMs, suggesting that the HMM associated to a given SHMM shows a certain affinity to this, which is higher than other HMMs.

Keywords: Semi-hidden Markov models; Hidden Markov models; Symbolic run sequences; Evaluation problem; Forward algorithm (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475416302518
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:137:y:2017:i:c:p:350-365

DOI: 10.1016/j.matcom.2016.12.002

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().