Chow–Liu tree

In probability theory and statistics Chow–Liu tree is an efficient method for constructing a second-order product approximation of a joint probability distribution, first described in a paper by Chow & Liu (1968). The goals of such a decomposition, as with such Bayesian networks in general, may be either data compression or inference.

A first-order dependency tree representing the product on the left.

The Chow–Liu representation

The Chow–Liu method describes a joint probability distribution ${\displaystyle P(X_{1},X_{2},\ldots ,X_{n})}$ as a product of second-order conditional and marginal distributions. For example, the six-dimensional distribution ${\displaystyle P(X_{1},X_{2},X_{3},X_{4},X_{5},X_{6})}$ might be approximated as

${\displaystyle P^{\prime }(X_{1},X_{2},X_{3},X_{4},X_{5},X_{6})=P(X_{6}|X_{5})P(X_{5}|X_{2})P(X_{4}|X_{2})P(X_{3}|X_{2})P(X_{2}|X_{1})P(X_{1})}$

where each new term in the product introduces just one new variable, and the product can be represented as a first-order dependency tree, as shown in the figure. The Chow–Liu algorithm (below) determines which conditional probabilities are to be used in the product approximation.^[1] In general, unless there are no third-order or higher-order interactions, the Chow–Liu approximation is indeed an approximation, and cannot capture the complete structure of the original distribution. Pearl (1988) provides a modern analysis of the Chow–Liu tree as a Bayesian network.

The Chow–Liu algorithm

Chow and Liu show how to select second-order terms for the product approximation so that, among all such second-order approximations (first-order dependency trees), the constructed approximation ${\displaystyle P^{\prime }}$ has the minimum Kullback–Leibler divergence to the actual distribution ${\displaystyle P}$, and is thus the closest approximation in the classical information-theoretic sense. The Kullback–Leibler divergence between a second-order product approximation and the actual distribution is shown to be

${\displaystyle D(P\parallel P^{\prime })=-\sum I(X_{i};X_{j(i)})+\sum H(X_{i})-H(X_{1},X_{2},\ldots ,X_{n})}$

where ${\displaystyle I(X_{i};X_{j(i)})}$ is the mutual information between variable ${\displaystyle X_{i}}$ and its parent ${\displaystyle X_{j(i)}}$ and ${\displaystyle H(X_{1},X_{2},\ldots ,X_{n})}$ is the joint entropy of variable set ${\displaystyle \{X_{1},X_{2},\ldots ,X_{n}\}}$. Since the terms ${\displaystyle \sum H(X_{i})}$ and ${\displaystyle H(X_{1},X_{2},\ldots ,X_{n})}$ are independent of the dependency ordering in the tree, only the sum of the pairwise mutual informations, ${\displaystyle \sum I(X_{i};X_{j(i)})}$, determines the quality of the approximation. Thus, if every branch (edge) on the tree is given a weight corresponding to the mutual information between the variables at its vertices, then the tree which provides the optimal second-order approximation to the target distribution is just the maximum-weight tree. The equation above also highlights the role of the dependencies in the approximation: When no dependencies exist, and the first term in the equation is absent, we have only an approximation based on first-order marginals, and the distance between the approximation and the true distribution is due to the redundancies that are not accounted for when the variables are treated as independent. As we specify second-order dependencies, we begin to capture some of that structure and reduce the distance between the two distributions.

Chow and Liu provide a simple algorithm for constructing the optimal tree; at each stage of the procedure the algorithm simply adds the maximum mutual information pair to the tree. See the original paper, Chow & Liu (1968), for full details. A more efficient tree construction algorithm for the common case of sparse data was outlined in Meilă (1999).

Chow and Wagner proved in a later paper Chow & Wagner (1973) that the learning of the Chow–Liu tree is consistent given samples (or observations) drawn i.i.d. from a tree-structured distribution. In other words, the probability of learning an incorrect tree decays to zero as the number of samples tends to infinity. The main idea in the proof is the continuity of the mutual information in the pairwise marginal distribution. More recently, the exponential rate of convergence of the error probability was provided.^[2]

Variations on Chow–Liu trees

The obvious problem which occurs when the actual distribution is not in fact a second-order dependency tree can still in some cases be addressed by fusing or aggregating together densely connected subsets of variables to obtain a "large-node" Chow–Liu tree (Huang, King & Lyu 2002), or by extending the idea of greedy maximum branch weight selection to non-tree (multiple parent) structures (Williamson 2000). (Similar techniques of variable substitution and construction are common in the Bayes network literature, e.g., for dealing with loops. See Pearl (1988).)

Generalizations of the Chow–Liu tree are the so-called t-cherry junction trees. It is proved that the t-cherry junction trees provide a better or at least as good approximation for a discrete multivariate probability distribution as the Chow–Liu tree gives. For the third order t-cherry junction tree see (Kovács & Szántai 2010), for the kth-order t-cherry junction tree see (Szántai & Kovács 2010). The second order t-cherry junction tree is in fact the Chow–Liu tree.

See also

• Bayesian network
• Knowledge representation