Skip to main content
. 2015 Feb 28;2015:839590. doi: 10.1155/2015/839590

Figure 3.

Figure 3

Pseudocode (a) and illustration (b) of a Bayesian network structure hill-climbing search procedure. E, G, D,  and  U, respectively, are edge sets, Bayesian graph, the training data, and a subset of vertices in Pseudocode (a).