Harman Patil (Editor)

Maximal information coefficient

Updated on
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In statistics, the maximal information coefficient (MIC) is a measure of the strength of the linear or non-linear association between two variables X and Y.

The MIC belongs to the maximal information-based nonparametric exploration (MINE) class of statistics. In a simulation study, MIC outperformed some selected low power tests, however concerns have been raised regarding reduced statistical power in detecting some associations in settings with low sample size when compared to powerful methods such as distance correlation and HHG. Comparisons with these methods, in which MIC was outperformed, were made in and. It is claimed that MIC approximately satisfies a property called equitability which is illustrated by selected simulation studies. It was later proved that no non-trivial coefficient can exactly satisfy the equitability property as defined by Reshef et al., although this result has been challenged. Some criticisms of MIC are addressed by Reshef et al. in further studies published on arXiv.


The maximal information coefficient uses binning as a means to apply mutual information on continuous random variables. Binning has been used for some time as a way of applying mutual information to continuous distributions; what MIC contributes in addition is a methodology for selecting the number of bins and picking a maximum over many possible grids.

The rationale is that the bins for both variables should be chosen in such a way that the mutual information between the variables be maximal. That is achieved whenever H ( X b ) = H ( Y b ) = H ( X b , Y b ) . Thus, when the mutual information is maximal over a binning of the data, we should expect that the following two properties hold, as much as made possible by the own nature of the data. First, the bins would have roughly the same size, because the entropies H ( X b ) and H ( Y b ) are maximized by equal-sized binning. And second, each bin of X will roughly correspond to a bin in Y.

Because the variables X and Y are reals, it is almost always possible to create exactly one bin for each (x,y) datapoint, and that would yield a very high value of the MI. To avoid forming this kind of trivial partitioning, the authors of the paper propose taking a number of bins n x for X and n y whose product is relatively small compared with the size N of the data sample. Concretely, they propose:

n x × n y N 0.6

In some cases it is possible to achieve a good correspondence between X b and Y b with numbers as low as n x = 2 and n y = 2 , while in other cases the number of bins required may be higher. The maximum for I ( X b ; Y b ) is determined by H(X), which is in turn determined by the number of bins in each axis, therefore, the mutual information value will be dependent on the number of bins selected for each variable. In order to compare mutual information values obtained with partitions of different sizes, the mutual information value is normalized by dividing by the maximum achieveable value for the given partition size. Entropy is maximized by uniform probability distributions, or in this case, bins with the same number of elements. Also, joint entropy is minimized by having a one-to-one correspondence between bins. If we substitute such values in the formula I ( X ; Y ) = H ( X ) + H ( Y ) H ( X , Y ) , we can see that the maximum value achieveable by the MI for a given pair n x , n y of bin counts is log min ( n x , n y ) . Thus, this value is used as a normalizing divisor for each pair of bin counts.

Last, the normalized maximal mutual information value for different combinations of n x and n y is tabulated, and the maximum value in the table selected as the value of the statistic.

It is important to note that trying all possible binning schemes that satisfy n x × n y N 0.6 is computationally unfeasible even for small n. Therefore in practice the authors apply a heuristic which may or may not find the true maximum.


Maximal information coefficient Wikipedia

Similar Topics
Kenny Bee
Steve Maslow
Callum Harriott