Next: Parameter Learning: Beta distribution
Previous: Markov Networks
[3 P] Consider the following distribution
- Draw the Bayesian network for this distribution.
- Draw the moralised graph.
- Draw the triangulated graph. Your triangulated should contain cliques of the smallest
- Draw a junction tree for the above graph and verify that it satisfies the running intersection
- Write down a suitable initialization of clique potentials.
- Find an appropriate message updating schedule.