ml-recall

#moralization

3 questions from Probabilistic & Graphical Models

Timed test

3 questions · 3 min · score and explanations at the end

Take a test

Q 1 / 3Score 0 / 0

Shuffle questions

Question 1: Single choice

mediumAI-checkedProbabilistic & Graphical Models

Graph (a) below is a Bayesian network and graph (b) a Markov random field over the same six variables. Which single edge must be added to (b) so that it implies no independence that fails in (a)?

(a) Directed graph: x1 → y1, x1 → y2, x2 → y1, x2 → y2, x2 → y3, x3 → y2, x3 → y3. (b) Undirected graph: x1–x2, x2–x3, x1–y1, x1–y2, x2–y1, x2–y2, x2–y3, x3–y2, x3–y3.

$x_1 - x_3$ 1
$y_1 - y_3$ 2
$x_1 - y_3$ 3
$y_1 - y_2$ 4

Keys: 1–9 select · Enter check / next