Exact and approximate hidden Markov chain filters based on discrete observations

From MaRDI portal
Publication:293595

DOI10.1515/STRM-2015-0004zbMATH Open1339.60040arXiv1411.0849OpenAlexW1758341678MaRDI QIDQ293595FDOQ293595


Authors: Nicole Bäuerle, Igor Gilitschenski, Uwe Hanebeck Edit this on Wikidata


Publication date: 9 June 2016

Published in: Statistics \& Risk Modeling (Search for Journal in Brave)

Abstract: We consider a Hidden Markov Model (HMM) where the integrated continuous-time Markov chain can be observed at discrete time points perturbed by a Brownian motion. The aim is to derive a filter for the underlying continuous-time Markov chain. The recursion formula for the discrete-time filter is easy to derive, however involves densities which are very hard to obtain. In this paper we derive exact formulas for the necessary densities in the case the state space of the HMM consists of two elements only. This is done by relating the underlying integrated continuous-time Markov chain to the so-called asymmetric telegraph process and by using recent results on this process. In case the state space consists of more than two elements we present three different ways to approximate the densities for the filter. The first approach is based on the continuous filter problem. The second approach is to derive a PDE for the densities and solve it numerically and the third approach is a crude discrete time approximation of the Markov chain. All three approaches are compared in a numerical study.


Full work available at URL: https://arxiv.org/abs/1411.0849




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Exact and approximate hidden Markov chain filters based on discrete observations

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