Institute of Information Theory and Automation

You are here

Bibliography

Journal Article

Recursive estimation of high-order Markov chains: Approximation by finite mixtures

Kárný Miroslav

: Information Sciences vol.326, 1 (2016), p. 188-201

: GA13-13502S, GA ČR

: Markov chain, Approximate parameter estimation, Bayesian recursive estimation, Adaptive systems, Kullback–Leibler divergence, Forgetting

: 10.1016/j.ins.2015.07.038

: http://library.utia.cas.cz/separaty/2015/AS/karny-0447119.pdf

(eng): A high-order Markov chain is a universal model of stochastic relations between discrete-valued variables. The exact estimation of its transition probabilities suffers from the curse of dimensionality. It requires an excessive amount of informative observations as well as an extreme memory for storing the corresponding sufficient statistic. The paper bypasses this problem by considering a rich subset of Markov-chain models, namely, mixtures of low dimensional Markov chains, possibly with external variables. It uses Bayesian approximate estimation suitable for a subsequent decision making under uncertainty. The proposed recursive (sequential, one-pass) estimator updates a product of Dirichlet probability densities (pds) used as an approximate posterior pd, projects the result back to this class of pds and applies an improved data-dependent stabilised forgetting, which counteracts the dangerous accumulation of approximation errors.

: BC

2019-01-07 08:39