M arkov Networks
Enrique Castillo, Ali S. Hadi · Wiley StatsRef: Statistics Reference Online · 2014
Abstract Many practical applications require the specification of the joint probability density (JPD) of a large set of random variables. This task can be very difficult in practice. Bayesian and Markov networks are two graphically based models that make the specification of the JPD and the propagation of uncertainty simple and efficient because they exploit the conditional independence structure of the JPD. This entry deals with Markov networks. Bayesian networks are discussed in another entry. Markov networks are defined and the questions about how Markov networks can be constructed, how Markov networks can be learnt from data, and how uncertainty can be propagated when new evidence becomes available are also discussed.