Pairwise Markov trees
From MaRDI portal
The hidden Markov chain models have been recently generalized by W. Pieckzunaski and A. N. Tebbache to ``pairwise Markov chains models. The author generalizes the hidden Markov trees to ``pairwise Markov trees, which present the same processing advantages and better modelling power.
Recommendations
Cites work
Cited in
(9)- Kalman filtering in pairwise Markov trees
- Arbres de Markov triplet et fusion de Dempster-Shafer. (Triplet Markov trees and Dempster-Shafer fusion)
- Modèles de Markov triplet et filtrage de Kalman (Triplet Markov models and Kalman filtering)
- Pairwise Markov trees
- Unsupervised data classification using pairwise Markov chains with automatic copulas selection
- Triplet Markov chains
- Exact Bayesian prediction in a class of Markov-switching models
- scientific article; zbMATH DE number 7424978 (Why is no real title available?)
- Pairwise Markov models and hybrid segmentation approach
This page was built for publication: Pairwise Markov trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608685)