jt_nbinary_ops

jt_nbinary_ops.triangulation

Number of binary operations needed to propagate in a junction tree
given evidence, using the Lauritzen-Spiegelhalter scheme

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

jt_nbinary_ops function

<dl><dt>x</dt>
<dd>A junction tree object or an object returned from
the triangulation function</dd>
<dt>evidence</dt>
<dd>List of character vectors with evidence nodes</dd>
<dt>root</dt>
<dd>Integer specifying the root node in the junction tree</dd>
<dt>nc</dt>
<dd>Integer. The number of cores to be used in parallel</dd></dl>

Arguments

Number of Binary Operations — jt_nbinary_ops

<dl>

<dt>x</dt>
<dd>A junction tree object or an object returned from
the triangulation function</dd>


<dt>evidence</dt>
<dd>List of character vectors with evidence nodes</dd>


<dt>root</dt>
<dd>Integer specifying the root node in the junction tree</dd>


<dt>nc</dt>
<dd>Integer. The number of cores to be used in parallel</dd>

</dl>

jt_nbinary_ops: Number of Binary Operations

Description

Usage

Arguments