Description Usage Arguments Details Value Examples
The function jointly construct gene co-expression network for multiple class using Condition-adaptive Fused Graphical Lasso. Pairwise screening matrics are required to adjust between-condition lasso penalty.
1 2 3 |
Y |
A list expression data which are n*p matrices. all matrices should have a same n and p. |
lambda1 |
The tuning parameter for the graphical lasso penalty. |
lambda2 |
The tuning parameter for the between condition group lasso penalty. |
btc.screening |
A list of screening matrices (p*p) for between condition penalty. Can be obtained using the function |
penalize.diag |
Binary variables that determine whether lambda1 and lambda2 are applied to the diagonal of inverse matrices. |
rho |
Step size parameter for ADMM algorithm. Large values decrease the step size. |
rho.increment |
Adjustment for rho. In each ADMM iteration, rho will be updated as rho=rho*rho.increment. |
maxiter |
The maximum number of ADMM interactions. |
tol |
The criterion for ADMM convergence. |
truncate |
All value in the estimated inverse convenience below this number will be set to 0. |
loglik.trace |
Store trace of the likelihood of estimation in each iteration. |
weight |
Experimental features that assigning weights to each class. Leaving it as default (NULL) is suggested. |
Please refer An adaptive procedure for inferring condition-specific gene co-expression network
CFGL
produces a list that contains estimated inverse matrices and other necessary components.
$theta The estimation of inverse matrices
$iters The numebr of ADMM iterations
$loglik.trace Trace of log-likelihood
1 2 3 4 5 6 7 8 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.