Description Usage Arguments Value Examples
Estimates an adjacencey matrix for a DAG based on l1 penalized negative likelihood minimization given a partitioning of the nodes into two groups
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
X |
a matrix of size n by p containing n observations an p variables |
l |
penalization parameter |
m1 |
the node at which the partition occurs |
m2 |
not relevant |
m3 |
not relevant |
m4 |
not relevant |
m5 |
not relevant |
m6 |
not relevant |
m7 |
not relevant |
m8 |
not relevant |
m9 |
not relevant |
eps |
tolerance parameter to decide whether algorithm has converved or not |
maxitr |
maximum number of iterations to run before returning output |
init |
initial estimate of graph adjacency B |
graph adjacency B
1 | partial2(X = X, l = 2, m1 = 25)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.