Mastering Probabilistic Graphical Models Using Python

MAP using variable elimination

Let's start with a very basic example of a network A -> B, as shown in the following figure:

Fig 3.13: Basic Bayesian network with two variables

For MAP, we want to compute the following:

If we consider any particular assignment a for the variable A, we have the following:

So, for any given assignment of A, we have to select the assignment of B for which P(b|a) is at maximum. We also have to select the maximum assignment of ...