CPDAG

CPDAG-class

Base class implementing Complete Partially Directed Acyclic Graphs (CPDAGs)

classes

graphs

Structure learning and parameter estimation of discrete Bayesian networks using likelihood-based criteria.  Exhaustive search for fixed node orders and stochastic search of optimal orders via simulated annealing algorithm are implemented.

Nikolay Balov

catnet

Categorical Bayesian Network Inference

Peter Salzman

CPDAG-class function

<dl>
	<dt><code>numnodes</code>:</dt>
<dd>an integer, the number of nodes</dd></dl>	<dt><code>nodes</code>:</dt>
<dd>a <code>vector</code> of node names</dd>	<dt><code>edges</code>:</dt>
<dd>a <code>list</code> of graph edges</dd>

Slots

Author

Class CPDAG — CPDAG-class

<dl>
	<dt><code>numnodes</code>:</dt>
<dd>an integer, the number of nodes</dd>

	<dt><code>nodes</code>:</dt>
<dd>a <code>vector</code> of node names</dd>

	<dt><code>edges</code>:</dt>
<dd>a <code>list</code> of graph edges</dd>

 
</dl>

CPDAG-class: Class CPDAG

Description

Arguments

Slots

Author

See Also