clr.net {minet}R Documentation

Context Likelihood or Relatedness Network

Description

clr.net uses the mutual information matrix to build a network - see details.

Usage

clr.net( mim )

Arguments

mim the mutual information matrix - see build.mim

Details

The CLR algorithm is an extension of relevance network. Instead of considering the information I(Xi;Xj) between features Xi and Xj, it takes into account the score sqrt(zi^2+zj^2), where

zi = max( 0, ( I(Xi;Xj)-mean(Xi) )/sd(Xi) )


and mean(Xi) and sd(Xi) are, respectively, the mean and the standard deviation of the empirical distribution of the mutual information values I(Xi,Xk), k=1,...,n.

Value

clr.net returns a matrix which is the weighted adjacency matrix of the network. In order to display the network, load the package Rgraphviz and use the following comand plot( as( returned.matrix ,"graphNEL") )

References

Jeremiah J. Faith, Boris Hayete, Joshua T. Thaden, Ilaria Mogno, Jamey Wierzbowski, Guillaume Cottarel, Simon Kasif, James J. Collins, and Timothy S. Gardner. Large-scale mapping and validation of escherichia coli transcriptional regulation from a compendium of expression profiles. PLoS Biology, 2007.

See Also

build.mim, aracne.net, mr.net

Examples

data(syn.data)
mim <- build.mim(disc(syn.data))
net <- clr.net(mim)

[Package minet version 1.1.3 Index]