bibtype V - Research Report
ARLID 0444151
utime 20240103210103.9
mtime 20150609235959.9
title (primary) (eng) Recursive Estimation of High-Order Markov Chains: Approximation by Finite Mixtures
publisher
place ÚTIA AV ČR, v.v.i
pub_time 2015
specification
page_count 28 s.
media_type P
edition
name Research Report
volume_id 2350
keyword Markov chain
keyword approximate parameter estimation
keyword Bayesian recursive estimation
keyword adaptive systems
keyword Kullback-Leibler divergence
keyword forgetting
author (primary)
ARLID cav_un_auth*0101124
name1 Kárný
name2 Miroslav
full_dept (cz) Adaptivní systémy
full_dept (eng) Department of Adaptive Systems
department (cz) AS
department (eng) AS
institution UTIA-B
full_dept Department of Adaptive Systems
share 100
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
cas_special
project
project_id GA13-13502S
agency GA ČR
ARLID cav_un_auth*0292725
abstract (eng) A high-order Markov chain is a universal model of stochastic relations between discrete-valued variables. The exact estimation of its transition probabilities suers from the curse of dimensionality. It requires an excessive amount of informative observations as well as an extreme memory for storing the corresponding su cient 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.
reportyear 2016
RIV BC
num_of_auth 1
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0247113
confidential S
arlyear 2015
mrcbU10 2015
mrcbU10 ÚTIA AV ČR, v.v.i