MARKOV BLANKET

In machine learning, the 'Markov blanket' for a node $A$ in a Bayesian network is the set of nodes $partial\; A$ composed of $A$'s parents, its children, and its children's parents. In a Markov network, the Markov blanket of a node is its set of neighbouring nodes. A Markov network may also be denoted with $MB(A)$.
Every set of nodes in the network is conditionally independent of $A$ when conditioned on the set $partial\; A$, that is, when conditioned on the Markov blanket of the node $A$. Formally, for distinct nodes $A$ and $B$:
:$Pr(A\; mid\; partial\; A\; cap\; B)\; =\; Pr(A\; mid\; partial\; A).\; !$
The values of the parents and children of a node evidently give information about that node. However, its children's parents also have to be included, because they can be used to explain away the node in question.
The Markov blanket of a node is interesting because it identifies all the variables that shield off the node from the rest of the network. This means that the Markov blanket of a node is the only knowledge that is needed to predict the behaviour of that node. The term was coined by Pearl in 1988.^[1]

Contents

Notes

Notes

1. Pearl, J. ''Probabilistic Reasoning in Intelligent Systems'', Morgan Kaufmann, 1988.