Description Usage Arguments Details Value References See Also Examples
Default function for the MRNET network inference algorithm
| 1 | 
| data | Numeric matrix with the microarray dataset to infer the network. Columns contain variables and rows contain samples. | 
The MRNET approach consists in repeating a MRMR feature selection 
procedure for each variable of the dataset.
The MRMR method starts by selecting the variable Xi having 
the highest mutual information with the target Y. 
In the following steps, given a set S of selected 
variables, the criterion updates S by choosing the 
variable Xk that maximizes 
 I(Xk;Y) - mean(I(Xk;Xi)), Xi in S.
The weight of each pair Xi,Xj will be the maximum score 
between the one computed when Xi is the target and the one 
computed when Xj is the target.
mrnet.wrap returns a matrix which is the weighted adjacency  
matrix of the network inferred by MRNET algorithm. 
The wrapper uses the "spearman" correlation (can be used with continuous 
data) to estimate the entropy - see build.mim.
Patrick E. Meyer, Kevin Kontos, Frederic Lafitte and Gianluca Bontempi. Information-theoretic inference of large transcriptional regulatory networks. EURASIP Journal on Bioinformatics and Systems Biology, 2007.
Patrick E. Meyer, Frederic Lafitte and Gianluca Bontempi. minet: A R/Bioconductor Package for Inferring Large Transcriptional Networks Using Mutual Information. BMC Bioinformatics, Vol 9, 2008.
H. Peng, F.long and C.Ding. Feature selection based on mutual information: Criteria of max-dependency, max relevance and min redundancy. IEEE transaction on Pattern Analysis and Machine Intelligence, 2005.
| 1 2 3 4 |      # Data
    data <- grndata::getData(datasource.name = "toy",FALSE)
    # Inference
    net <- mrnet.wrap(data)
 | 
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.