Skip to main content
. Author manuscript; available in PMC: 2009 Sep 15.
Published in final edited form as: J Mach Learn Res. 2008 Dec 1;9:2847–2880.

Algorithm 4.

Separation Tree Refinement.

Input: A crude separation tree Inline graphicc for Inline graphic; perfect conditional independence knowledge.
Output: A refined separation tree Inline graphic for Inline graphic.
1 Construct an undirected independence subgraph over each node of Inline graphicc;
2 Combine the subgraphs into a global undirected independence graph Inline graphic¯ whose edge set is the union of all edge sets of subgraphs;
3 Construct a junction tree Inline graphic of Inline graphic¯.