BayesNetBP (version 1.0.1)

ClusterTreeCompile: Compile the cluster tree

Description

Get the cluster sets and strong semi-elimination tree from the Bayessian network

Usage

ClusterTreeCompile(dag, node.class)

Arguments

dag

a graphNEL object of the Bayesian network

node.class

a named vector of logical values, TRUE if node is discrete, FASLE if otherwise

Value

tree.graph

a graphNEL object of semi-elimination tree.

dag

a graphNEL object of original Bayesian network.

cluster.sets

a list of members of each cluster.

node.class

a named vector of logical values, TRUE if node is discrete, FASLE if otherwise

elimination.order

a vector of node names sorted by the elimination order.

Details

This function forms the cluster sets and the semi-elimination tree graph from the Bayesian network. The procedures include acquiring the elimination order, moralization, triangulation, obtaining cluster sets, forming strong elimination tree and strong semi-elimination tree. The cluster sets and the semi-elimination tree are required to initialize the cluster tree.

References

Cowell, R. G. (2005). Local propagation in conditional Gaussian Bayesian networks. Journal of Machine Learning Research, 6(Sep), 1517-1550.

See Also

ElimTreeInitialize

Examples

data(liver)
cst <- ClusterTreeCompile(dag=liver$dag, node.class=liver$node.class)