The randomized information coefficient: assessing dependencies in noisy data

11Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

When differentiating between strong and weak relationships using information theoretic measures, the variance plays an important role: the higher the variance, the lower the chance to correctly rank the relationships. We propose the randomized information coefficient (RIC), a mutual information based measure with low variance, to quantify the dependency between two sets of numerical variables. We first formally establish the importance of achieving low variance when comparing relationships using the mutual information estimated with grids. Second, we experimentally demonstrate the effectiveness of RIC for (i) detecting noisy dependencies and (ii) ranking dependencies for the applications of genetic network inference and feature selection for regression. Across these tasks, RIC is very competitive over other 16 state-of-the-art measures. Other prominent features of RIC include its simplicity and efficiency, making it a promising new method for dependency assessment.

Cite

CITATION STYLE

APA

Romano, S., Vinh, N. X., Verspoor, K., & Bailey, J. (2018). The randomized information coefficient: assessing dependencies in noisy data. Machine Learning, 107(3), 509–549. https://doi.org/10.1007/s10994-017-5664-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free