Interaction information

From Wikipedia, the free encyclopedia

You have new messages (last change).

The interaction information (McGill 1954) or co-information (Bell 2003) is one of several generalizations of the mutual information, and expresses the amount information (redundancy or synergy) bound up in a set of variables, beyond that which is present in any subset of those variables. Unlike the mutual information, the interaction information can be either positive or negative. This confusing property has likely retarded its wider adoption as an information measure in machine learning and cognitive science.


Contents

[edit] The Three-Variable Case

For three variables {X,Y,Z}, the interaction information I(X;Y;Z) is given by


\begin{matrix} I(X;Y;Z) & = & I(X;Y|Z)-I(X;Y) \\ \ & = & I(X;Z|Y)-I(X;Z) \\ \ & = & I(Y;Z|X)-I(Y;Z) \end{matrix}


where, for example, I(X;Y) is the mutual information between variables X and Y, and I(X;Y | Z) is the conditional mutual information between variables X and Y given Z. Formally,


\begin{matrix} I(X;Y|Z) & = & H(X|Z) + H(Y|Z) - H(X,Y|Z) \\ \ & = & H(X|Z)-H(X|Y,Z) \end{matrix}


For the three-variable case, the interaction information I(X;Y;Z) is the difference between the information shared by {Y,X} when Z has been fixed and when Z has not been fixed. (See also Fano's 1961 textbook.) Interaction information measures the influence of a variable Z on the amount of information shared between {Y,X}. Because the term I(X;Y | Z) can be zero — for example, when the dependency between {X,Y} is due entirely to the influence of a common cause Z, the interaction information can be negative as well as positive. Negative interaction information indicates that variable Z inhibits (i.e., accounts for or explains some of) the correlation between {Y,X}, whereas positive interaction information indicates that variable Z facilitates or enhances the correlation between {Y,X}.


[edit] Example of Negative Interaction Information

Negative interaction information seems much more natural than positive interaction information in the sense that such explanatory effects are typical of common-cause structures. For example, clouds cause rain and also block the sun; therefore, the correlation between rain and darkness is partly accounted for by the presence of clouds, I(rain;dark|cloud) \leq I(rain;dark). The result is negative interaction information I(rain;dark;cloud).

[edit] Example of Positive Interaction Information

The case of positive interaction information seems a bit less natural. A prototypical example of positive I(X;Y;Z) has X as the output of an XOR gate to which Y and Z are the independent random inputs. In this case I(Y;Z) will be zero, but I(Y;Z | X) will be positive (1 bit) since once output X is known, the value on input Y completely determines the value on input Z. Since I(Y;Z | X) > I(Y;Z), the result is positive interaction information I(X;Y;Z). It may seem that this example relies on a peculiar ordering of X,Y,Z to obtain the positive interaction, but the symmetry of the definition for I(X;Y;Z) indicates that the same positive interaction information results regardless of which variable we consider as the interloper or conditioning variable. For example, input Y and output X are also independent until input Z is fixed, at which time they are totally dependent (obviously), and we have the same positive interaction information as before, I(X;Y;Z) = I(X;Y | Z) − I(X;Y).

This situation is an instance where fixing the common effect X of causes Y and Z induces a dependency among the causes that did not formerly exist. This behavior is colloquially referred to as explaining away and is thoroughly discussed in the Bayesian Network literature (e.g., Pearl 1988}. Pearl's example is auto diagnostics: A car's engine can fail to start (X) due either to a dead battery (Y) or due to a blocked fuel pump (Z). Ordinarily, we assume that battery death and fuel pump blockage are independent events, because of the essential modularity of such automotive systems. Thus, in the absence of other information, knowing whether or not the battery is dead gives us no information about whether or not the fuel pump is blocked. However, if we happen to know that the car fails to start (i.e., we fix common effect X), this information induces a dependency between the two causes battery death and fuel blockage. Thus, knowing that the car fails to start, if an inspection shows the battery to be in good health, we can conclude that the fuel pump must be blocked.

Battery death and fuel blockage are thus dependent, conditional on their common effect car starting. What the foregoing discussion indicates is that the obvious directionality in the common-effect graph belies a deep informational symmetry: If conditioning on a common effect increases the dependency between its two parent causes, then conditioning on one of the causes must create the same increase in dependency between the second cause and the common effect. In Pearl's automotive example, if conditioning on car starts induces I(X;Y;Z) bits of dependency between the two causes battery dead and fuel blocked, then conditioning on fuel blocked must induce I(X;Y;Z) bits of dependency between battery dead and car starts. This may seem odd because battery dead and car starts are already governed by the implication battery dead \rightarrow car doesn't start. However, these variables are still not totally correlated because the converse is not true. Conditioning on fuel blocked removes the major alternate cause of failure to start, and strengthens the converse relation and therefore the association between battery dead and car starts. A paper by Tsujishita (1995) focuses in greater depth on the third-order mutual information.

[edit] The Four-Variable Case

One can recursively define the n-dimensional interaction information in terms of the (n − 1)-dimensional interaction information. For example, the four-dimensional interaction information can be defined as


\begin{matrix} I(W;X;Y;Z) & = & I(X;Y;Z|W)-I(X;Y;Z) \\ \ & = & I(X;Y|Z,W)-I(X;Y|W)-I(X;Y|Z)+I(X;Y) \end{matrix}


or, equivalently,


\begin{matrix} I(W;X;Y;Z)& = & H(W)+H(X)+H(Y)+H(Z) \\ \ & - & H(W,X)-H(W,Y)-H(W,Z)-H(X,Y)-H(X,Z)-H(Y,Z) \\ \ & + & H(W,X,Y)+H(W,X,Z)+H(W,Y,Z)+H(X,Y,Z)-H(W,X,Y,Z) \end{matrix}

[edit] The n-Variable Case

It is possible to extend all of these results to an arbitrary number of dimensions. The general expression for interaction information on variable set \mathcal{V}=\{X_{1},X_{2},\ldots ,X_{n}\} in terms of the marginal entropies is given by Jakulin & Bratko (2003).


I(\mathcal{V})\equiv -\sum_{\mathcal{T}\subseteq \mathcal{V}}(-1)^{\left\vert\mathcal{V}\right\vert -\left\vert \mathcal{T}\right\vert}H(\mathcal{T})


which is an alternating (inclusion-exclusion) sum over all subsets \mathcal{T}\subseteq \mathcal{V}, where \left\vert \mathcal{V}\right\vert =n. Note that this is the information-theoretic analog to the Kirkwood approximation.


[edit] Difficulties Interpreting Interaction Information

The possible negativity of interaction information can be the source of some confusion (Bell 2003). As an example of this confusion, consider a set of eight independent binary variables {X1,X2,X3,X4,X5,X6,X7,X8}. Agglomerate these variables as follows:


\begin{matrix} Y_{1} &=&\{X_{1},X_{2},X_{3},X_{4},X_{5},X_{6},X_{7}\} \\ Y_{2} &=&\{X_{4},X_{5},X_{6},X_{7}\} \\ Y_{3} &=&\{X_{5},X_{6},X_{7},X_{8}\} \end{matrix}


Because the Yi's overlap each other (are redundant) on the three binary variables {X5,X6,X7}, we would expect the interaction information I(Y1;Y2;Y3) to equal − 3 bits, which it does. However, consider now the agglomerated variables


\begin{matrix} Y_{1} &=&\{X_{1},X_{2},X_{3},X_{4},X_{5},X_{6},X_{7}\} \\ Y_{2} &=&\{X_{4},X_{5},X_{6},X_{7}\} \\ Y_{3} &=&\{X_{5},X_{6},X_{7},X_{8}\} \\ Y_{4} &=&\{X_{7},X_{8}\} \end{matrix}


These are the same variables as before with the addition of Y4 = {X7,X8}. Because the Yi's now overlap each other (are redundant) on only one binary variable {X7}, we would expect the interaction information I(Y1;Y2;Y3;Y4) to equal − 1 bit. However, I(Y1;Y2;Y3;Y4) in this case is actually equal to + 1 bit, indicating a synergy rather than a redundancy. This is correct in the sense that


\begin{matrix} I(Y_{1};Y_{2};Y_{3};Y_{4}) & = & I(Y_{1};Y_{2};Y_{3}|Y_{4})-I(Y_{1};Y_{2};Y_{3}) \\ \ & = & -2+3 \\ \ & = & 1 \end{matrix}


but it remains difficult to interpret.

[edit] Uses of Interaction Information

Jakulin and Bratko (2003b) provide a machine learning algorithm which uses interaction information.

[edit] References

  • Bell, A J (2003), ‘The co-information lattice’ [1]
  • Fano, R M (1961), Transmission of Information: A Statistical Theory of Communications, MIT Press, Cambridge, MA.
  • Garner W R (1962). Uncertainty and Structure as Psychological Concepts, JohnWiley & Sons, New York.
  • Han T S (1978). Nonnegative entropy measures of multivariate symmetric correlations, Information and Control 36, 133-156.
  • Han T S (1980). Multiple mutual informations and multiple interactions in frequency data, Information and Control 46, 26-45.
  • Jakulin A & Bratko I (2003a). Analyzing Attribute Dependencies, in N Lavra\quad{c}, D Gamberger, L Todorovski & H Blockeel, eds, Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, Springer, Cavtat-Dubrovnik, Croatia, pp. 229-240.
  • Jakulin A & Bratko I (2003b). Quantifying and visualizing attribute interactions [[2]].
  • McGill W J (1954). Multivariate information transmission, Psychometrika 19, 97-116.
  • Nemenman I (2004). Information theory, multivariate dependence, and genetic network inference [[3]].
  • Pearl, J (1988), Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, CA.
  • Tsujishita, T (1995), ‘On triple mutual information’, Advances in applied mathematics 16, 269-–274.
Retrieved from "http://en.wikipedia.org../../../i/n/t/Interaction_information.html"