Comment on "Detecting Novel Associations In Large Data Sets" by Reshef Et Al, Science Dec 16, 2011

Abstract

The proposal of Reshef et al. (2011) is an interesting new approach for discovering non-linear dependencies among pairs of measurements in exploratory data mining. However, it has a potentially serious drawback. The authors laud the fact that MIC has no preference for some alternatives over others, but as the authors know, there is no free lunch in Statistics: tests which strive to have high power against all alternatives can have low power in many important situations. To investigate this, we ran simulations to compare the power of MIC to that of standard Pearson correlation and distance correlation (dcor). We simulated pairs of variables with different relationships (most of which were considered by the Reshef et. al.), but with varying levels of noise added. To determine proper cutoffs for testing the independence hypothesis, we simulated independent data with the appropriate marginals. As one can see from the Figure, MIC has lower power than dcor, in every case except the somewhat pathological high-frequency sine wave. MIC is sometimes less powerful than Pearson correlation as well, the linear case being particularly worrisome.

3 pages, 1 figure

References in corpus (1)

• Brownian distance covariance

Cited by in corpus (8)

• Efficient Estimation of Mutual Information for Strongly Dependent Variables
• Consistent distribution-free $K$-sample and independence tests for univariate random variables
• Discovering and Deciphering Relationships Across Disparate Data Modalities
• independence: Fast Rank Tests
• Adaptive Geo-Topological Independence Criterion
• Generalized Pearson correlation squares for capturing mixtures of bivariate linear dependences
• On the Effect of Suboptimal Estimation of Mutual Information in Feature Selection and Classification
• Dependence Measure for non-additive model