Chow–Liu tree
From Wikipedia, the free encyclopedia
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.
![Thumb image](http://upload.wikimedia.org/wikipedia/en/6/69/Chow-liu.png)