Description Usage Arguments Value
by finding covered edges and reverting them. sugar wrapped version. Use gaussCItest
1 | SparsestPermutation(X, DNA = F, k = 0, alpha, r, d, verbose = F)
|
X: |
data matrix |
alpha: |
CI test level |
DNA: |
use DNA or not. If FALSE, just run SP. If TRUE, learn DNA first |
k: |
if DNA, levels of PC used in learning step |
r: |
number of restarts |
d: |
depth of search |
verbose: |
whether to print the learning path. |
CPDAG
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.