Triplet Markov chains (Q1854705): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Solution of Ill-Posed Problems in Computational Vision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise Markov trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem / rank
 
Normal rank

Latest revision as of 10:18, 5 June 2024

scientific article
Language Label Description Also known as
English
Triplet Markov chains
scientific article

    Statements

    Triplet Markov chains (English)
    0 references
    14 May 2003
    0 references
    Denote by \(X_n\) a hidden process that we estimate from an observed process \(Y_n\). When \(X_n\) has a finite set of values and \((X_n,Y_n)\) is Markov, recursive formulas may be used in computations, this is called the pairwise Markov chains model in previous works. Now, when \((X_n,Y_n)\) is not Markov, it may be that with additional information \(U_n\), some \((X_n,U_n,Y_n)\) is. If \(U_n\) also has a finite set of values the same formulas yield estimates for \((X_n,U_n)\), then for \(X_n\) after addition. The author names this the triplet Markov chain model.
    0 references
    hidden Markov chains
    0 references

    Identifiers