propagate

propagate.jt

Given a junction tree object, propagation is conducted

Minimal and memory efficient implementation of the junction tree
algorithm using the Lauritzen-Spiegelhalter scheme;
S. L. Lauritzen and D. J. Spiegelhalter (1988)
<https://www.jstor.org/stable/2345762?seq=1>. The jti package is
part of the paper <doi:10.18637/jss.v111.i02>.

Mads Lindskou

Junction Tree Inference

propagate function

<dl><dt>x</dt>
<dd>A junction tree object <code>jt</code></dd>
<dt>prop</dt>
<dd>Either "collect" or "full".</dd></dl>

Arguments

Propagation of junction trees — propagate

<dl>

<dt>x</dt>
<dd>A junction tree object <code>jt</code></dd>


<dt>prop</dt>
<dd>Either "collect" or "full".</dd>

</dl>

propagate: Propagation of junction trees

Description

Usage

Arguments

See Also

Examples