High-order extensions of the Double Chain Markov Model

From MaRDI portal





Let \(\{Y_t\}\) be a non-homogeneous \(f\)-order Markov chain taking values in the set \(\{1,\dots,K\}\). The matrix of transition probabilities at time \(t\) depends on an unobservable variable \(X_t\) where \(\{X_t\}\) is an \(l\)-order Markov chain with the set of states \(\{1,\dots,M\}\). This double chain Markov model (DCMM) can represent time series in a random environment. Since the DCMM has many parameters, their number can be considerably reduced using a mixture transition distribution model. The estimation of parameters is based on an EM algorithm. The optimal sequence of states is computed via Viterbi algorithm. The model is applied to an analysis of a sequence of DNA, to the song of the wood pewee and to the behavior of young monkeys. The author introduces a www address where a software called MARCH for the computation of DCMM is freely available.











This page was built for publication: High-order extensions of the Double Chain Markov Model

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