Returns the undirected graph of a mixed data set of continuous and discrete variables. This is an improved version of the Lee & Hastie algorithm (JMLR, 2012). The improvements include the use of three sparsity parameters, depending on the edge type (continuous-continuous, continuous-discrete, discrete-discrete) and a subsampling method to find the optimal sparsities. It also outputs the graph to a .txt file
DataSet object returned from loadData()
Graph object, undirected graph resulting from MGM
AJ Sedgewick, Neha Abraham, Panagiotis Benos
AJ Sedgewick, I Shi, RM Donovan, PV Benos, "Learning mixed graphical models with separate sparsity parameters and stability-based model selection", 2016, BM Bioinformatics 17(Suppl 5):S175 DOI: 10.1186/s12859-016-1039-0 https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1039-0
1 2 3 4
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.