Fitting probabilistic automata via the em algorithm

DOI10.1080/15326349608807392MaRDI QIDQ4895648zbMATH OpenOpenAlexFDO

Authors William Turin

Publication date 18 March 1997

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326349608807392

zbMATH Keywords

EM algorithmhidden Markov modelsMarkov modulated Bernoulli processesMarkov modulated Poisson processesMarkovian arrivalmodel fittingphase type distributionsprobabilistic automata

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computer system organization (68M99) Formal languages and automata (68Q45) Measures of information, entropy (94A17)

Recommendations

• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• An EM algorithm for estimation in Markov-modulated Poisson processes
• Theory and use of the EM algorithm
• scientific article; zbMATH DE number 1183924
• scientific article; zbMATH DE number 1182749

Cited in

(4)

• Modelling discrete longitudinal data using acyclic probabilistic finite automata
• scientific article; zbMATH DE number 1670712 (Why is no real title available?)
• Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique
• Transduction from trees to graphs through folding

This page was built for publication: Fitting probabilistic automata via the em algorithm

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