Maximal information coefficient

Known as: MIC 
In statistics, the maximal information coefficient (MIC) is a measure of the strength of the linear or non-linear association between two variables X… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Software defect prediction (SDP) plays a significant part in identifying the most defect-prone modules before software testing… (More)
  • table I
  • table II
Is this relevant?
2017
2017
For understanding the complex processes of regulation within the system of cellular and every process of life in different… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2016
2016
The maximal information coefficient (MIC), a measure of dependence for two-variable relationships, can be used to discover the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2016
2016
High-throughput bio-OMIC technologies are producing high-dimension data from bio-samples at an ever increasing rate, whereas the… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
Gene Regulatory Network (GRN) plays an important role to understand the interactions and dependencies of genes in different… (More)
  • table 1
  • table II
Is this relevant?
2014
2014
Reshef et al. (Science 334:1518–1523, 2011) introduce the maximal information coefficient, or MIC, which captures a wide range of… (More)
  • table 1
  • figure 1
  • table 2
  • table 4
  • table 3
Is this relevant?
2014
2014
The maximal information coefficient (MIC) is a tool for finding the strongest pairwise relationships in a data set with many… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2013
2013
A measure of dependence is said to be equitable if it gives similar scores to equally noisy relationships of different types… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2013
2013
Feature selection is usually a separate procedure which can not benefit from result of the data exploration. In this paper, we… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
For a Hamming space (X n ; dH) , the set of n{length words over the alphabet X = f0; 1; : : : ; 1g endowed with the distance dH… (More)
Is this relevant?