Is it not telling that this was published in a non-statistical journal whose statistical peer review we are unsure of?  This problem was solved by Hoeffding in 1948 (Annals of Mathematical Statistics 19:546) who developed a straightforward algorithm requiring no binning nor multiple steps.  Hoeffding's work was not even referenced in the Science article.  This has been in the R hoeffd function in the Hmisc package for many years.  Here's an example (type example(hoeffd) in R):

# Hoeffding's test can detect even one-to-many dependency
set.seed(1)
x <- seq(-10,10,length=200)
y <- x*sign(runif(200,-1,1))
plot(x,y)  # an X
hoeffd(x,y)  # also accepts a numeric matrix

D
     x    y
x 1.00 0.06
y 0.06 1.00

n= 200 

P
  x  y 
x     0   # P-value is very small
y  0   

hoeffd uses an efficient Fortran implementation of Hoeffding's method.  The basic idea of his test is to consider the difference between joint ranks of X and Y and the product of the marginal rank of X and the marginal rank of Y, suitably scaled.

Frank Harrell



I have since been corresponding with the authors (who are very nice by the way, and are open to other ideas and are continuing to research their methods).  They originally had the Hoeffding reference in their manuscript but cut it (with regrets, now) for lack of space.  While Hoeffding's D test seems to perform well for detecting dependence in their examples, it does not provide an index that meets their criteria of ordering degrees of dependence the way the human eye is able to.

In an upcoming release of the R `Hmisc` package I've added two additional outputs related to D, namely the mean and max $|F(x,y) - G(x)H(y)|$ which are useful measures of dependence.  However these measures, like D, do not have the property that the creators of MIC were seeking.