A Markovian approach to the induction of regular string distributions
(2004) 7th International Colloquium on Grammatical Inference — Location: Athens(Greece) (11.October.2004)
Files
pdfdocument.pdf
Restricted Access - Adobe PDF
- 318.25 KB
Details
- Authors
- Abstract
- We propose in this paper a novel approach to the induction of the structure of Hidden Markov Models (HMMs). The notion of partially observable Markov models (POMMs) is introduced. POMMs form a particular case of HMMs where any state emits a single letter with probability one, but several states can emit the same letter. It is shown that any HMM can be represented by an equivalent POMM. The proposed induction algorithm aims at finding a POMM fitting a sample drawn from an unknown target POMM. The induced model is built to fit the dynamics of the target machine observed in the sample. A POMM is seen as a lumped process of a Markov chain and the induced POMM is constructed to best approximate the stationary distribution and the mean first passage times (MFPT) observed in the sample. The induction relies on iterative state splitting from an initial maximum likelihood model. The transition probabilities of the updated model are found by solving an optimization problem to minimize the difference between the observed MFPT and their values computed in the induced model.
- Affiliations
Citations
Callut, J., & Dupont, P. (2004). A Markovian approach to the induction of regular string distributions. Lecture Notes in Computer Science, 3264, 77-90. https://doi.org/10.1007/978-3-540-30195-0_8 (Original work published 2004)