Research Article
A Decomposition Algorithm for Learning Bayesian Networks Based on Scoring Function
Algorithm 1
Decomposition algorithm for learning BNs.
(1) Input: Data set ; Variable set ; Node ordering . | (2) Construct the moral graph from the data set . | (3) Decompose the moral graph into its maximal prime subgraphs . | (4) For each sub-graph of , call the K2 algorithm with the local node | ordering of to construct a directed acyclic graph . | (5) Combine into a directed graph where | and . | (6) Output: A directed acyclic graph . |
|