title: The mutual information: detecting and evaluating dependencies between variables.
abstract: BACKGROUND
  Clustering co-expressed genes usually requires the definition of 'distance' or 'similarity' between measured datasets, the most common choices being Pearson correlation or Euclidean distance. With the size of available datasets steadily increasing, it has become feasible to consider other, more general, definitions as well. One alternative, based on information theory, is the mutual information, providing a general measure of dependencies between variables. While the use of mutual information in cluster analysis and visualization of large-scale gene expression data has been suggested previously, the earlier studies did not focus on comparing different algorithms to estimate the mutual information from finite data.
  
  
  RESULTS
  Here we describe and review several approaches to estimate the mutual information from finite datasets. Our findings show that the algorithms used so far may be quite substantially improved upon. In particular when dealing with small datasets, finite sample effects and other sources of potentially misleading results have to be taken into account.
authors.affiliation: University Potsdam, Nonlinear Dynamics Group, Germany. steuer@agnld.uni-potsdam.de
authors.forename: R
authors.initials: R
authors.lastname: Steuer
authors.forename: J
authors.initials: J
authors.lastname: Kurths
authors.forename: C O
authors.initials: CO
authors.lastname: Daub
authors.forename: J
authors.initials: J
authors.lastname: Weise
authors.forename: J
authors.initials: J
authors.lastname: Selbig
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D020869:Gene Expression Profiling / Q000379:methods*; D006801:Humans; D008957:Models, Genetic; D015233:Models, Statistical; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D012984:Software