cpt_list

cpt_list.list

cpt_list.data.frame

A check and conversion of cpts to be used in the junction tree algorithm

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

cpt_list function

<dl><dt>x</dt>
<dd>Either a named list with cpts in form of array-like object(s)
where names must be the child node or a <code>data.frame</code></dd>
<dt>g</dt>
<dd>Either a directed acyclic graph (DAG) as an igraph object or a
decomposable graph as an igraph object. If <code>x</code> is a list,
<code>g</code> must be <code>NULL</code>. The procedure then deduce the graph
from the conditional probability tables.</dd></dl>

Arguments

Conditional probability list — cpt_list

<dl>

<dt>x</dt>
<dd>Either a named list with cpts in form of array-like object(s)
where names must be the child node or a <code>data.frame</code></dd>


<dt>g</dt>
<dd>Either a directed acyclic graph (DAG) as an igraph object or a
decomposable graph as an igraph object. If <code>x</code> is a list,
<code>g</code> must be <code>NULL</code>. The procedure then deduce the graph
from the conditional probability tables.</dd>

</dl>

cpt_list: Conditional probability list

Description

Usage

Arguments

Examples