Description Usage Arguments Value Author(s) Examples
For a given prior graph, the two-step algorithm, including edge enrichment and pruning, is used to construct the model pool
1 |
data |
A |
lambda |
Tuning parameter vector |
P |
Prior adjacency matrix |
A list including all the candidate models in the model pool.
Each model is represented by a p
by p
adjacency matrix
Jie Zhou
1 2 3 4 5 6 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.