-
Book Overview & Buying
-
Table Of Contents
Causal Inference with Bayesian Networks
By :
This section introduces the crucial QCG compilation procedure, a practical and efficient method for finding the MEU and computing the MEU policy. It’s specifically tailored for decision networks represented by influence diagrams, particularly those that depict a single decision-maker who retains the information. The no-forgetting assumption underscores that the direct predecessor set for one decision must be a subset of the direct predecessor set of any subsequent decision.
First, we delve into the powerful and versatile variable elimination approach and its application in solving the MEU and deriving the MEU policy. We then demonstrate how the QCG algorithm harnesses this approach to compute the maximum expected utility (MEU) policy of a decision network example. To further enhance your understanding, we provide a practice section using R, where we compute the MEU decision policy on the quantified decision network model of the example...