Description Usage Arguments Value Author(s) See Also
Learn the Markov blanket or the neighbourhood centered on a node.
1 2 3 4 |
x |
a data frame containing the variables in the model. |
node |
a character string, the label of the node whose local structure is being learned. |
method |
a character string, the label of a structure learning
algorithm. Possible choices are constraint-based algorithms
for |
whitelist |
a vector of character strings, the labels of the whitelisted nodes. |
blacklist |
a vector of character strings, the labels of the blacklisted nodes. |
start |
a vector of character strings, the labels of the nodes to
be included in the Markov blanket before the learning process (in
|
test |
a character string, the label of the conditional
independence test to be used in the algorithm.
If none is specified, the default test statistic is the mutual
information for categorical variables, the Jonckheere-Terpstra test
for ordered factors and the linear correlation for continuous
variables. See |
alpha |
a numeric value, the target nominal type I error rate. |
B |
a positive integer, the number of permutations considered
for each permutation test. It will be ignored with a warning if
the conditional independence test specified by the |
debug |
a boolean value. If |
optimized |
a boolean value. See |
A vector of character strings, the labels of the nodes in the Markov
blanket (for learn.mb
) or in the neighbourhood (for learn.nbr
).
Marco Scutari
constraint-based algorithms, local discovery algorithms.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.