Define the set N as consisting of 8 node belief networks in which each node has at most 2 parents. For a given ancestral order a, the restricted set is written Na
How many belief networks are in Na?
What is the computational time to find the optimal member of Na using the Bayesian Dirichlet score, assuming that computing the BD score of any member of Na takes 1 second and bearing in mind the decomposability of the BD score.
Estimate the time required to find the optimal member of N?