Kirkwood approximation
From Wikipedia, the free encyclopedia
The Kirkwood superposition approximation was introduced by Matsuda (2000) as a means of representing a discrete probability distribution. The name apparently refers to a 1942 paper by John G. Kirkwood. The Kirkwood approximation for a discrete probability density function 
is given by
where 
is the product of probabilities over all subsets of variables of size i in variable set 
. This kind of formula has been considered by Watanabe (1960) and, according to Watanabe, also by Robert Fano. For the three variable case, it reduces to simply
The Kirkwood approximation does not generally produce a valid probability distribution (the normalization condition is violated). Watanabe claims that for this reason informational expressions of this type are not meaningful, and indeed there has been very little written about the properties of this measure. The Kirkwood approximation is the probabilistic counterpart of the interaction information.
Judea Pearl (1988 §3.2.4) indicates that an expression of this type can be exact in the case of a decomposable model, that is, a probability distribution which admits a graph structure whose cliques form a tree. In such cases, the numerator contains the product of the intra-clique joint distributions and the denominator contains the product of the clique intersection distributions.
[edit] References
- Jakulin, A. & Bratko, I. (2004), Quantifying and visualizing attribute interactions: An approach based on entropy, Journal of Machine Learning Research, (submitted) pp. 38-43.
- Matsuda, H. (2000), Physical nature of higher-order mutual information: Intrinsic correlations and frustration, Physical Review E 62, 3096-3102.
- Pearl, J. (1988), Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, CA.
- Watanabe, S. (1960), Information theoretical analysis of multivariate correlation, IBM Journal of Research and Development 4, 66-82.
