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