Description Usage Arguments Value Note Author(s) References See Also
Learn the structure of a Bayesian network with the Max-Min Hill Climbing (MMHC) and the more general 2-phase Restricted Maximization (RSMAX2) hybrid algorithms.
1 2 3 4 5 6 | rsmax2(x, whitelist = NULL, blacklist = NULL, restrict, maximize = "hc",
test = NULL, score = NULL, alpha = 0.05, B = NULL, ...,
maximize.args = list(), optimized = TRUE, strict = FALSE, debug = FALSE)
mmhc(x, whitelist = NULL, blacklist = NULL, test = NULL, score = NULL,
alpha = 0.05, B = NULL, ..., restart = 0, perturb = 1, max.iter = Inf,
optimized = TRUE, strict = FALSE, debug = FALSE)
|
x |
a data frame containing the variables in the model. |
whitelist |
a data frame with two columns (optionally labeled "from" and "to"), containing a set of arcs to be included in the graph. |
blacklist |
a data frame with two columns (optionally labeled "from" and "to"), containing a set of arcs not to be included in the graph. |
restrict |
a character string, the constraint-based algorithm
to be used in the “restrict” phase. Possible values are
|
maximize |
a character string, the score-based algorithm
to be used in the “maximize” phase. Possible values are
|
test |
a character string, the label of the conditional
independence test to be used by the constraint-based 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 |
score |
a character string, the label of the network score to
be used in the score-based algorithm. If none is specified, the
default score is the Bayesian Information Criterion for
both discrete and continuous data sets. See |
alpha |
a numeric value, the target nominal type I error rate of the conditional independence test. |
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 |
... |
additional tuning parameters for the network score used
by the score-based algorithm. See |
maximize.args |
a list of arguments to be passed to the score-based
algorithm specified by |
restart |
an integer, the number of random restarts for the score-based algorithm. |
perturb |
an integer, the number of attempts to randomly insert/remove/reverse an arc on every random restart. |
max.iter |
an integer, the maximum number of iterations for the score-based algorithm. |
debug |
a boolean value. If |
optimized |
a boolean value. See |
strict |
a boolean value. If |
An object of class bn
.
See bn-class
for details.
mmhc
is simply rshc
with restrict
set to
mmpc
and maximize
set to hc
.
Marco Scutari
Tsamardinos I, Brown LE, Aliferis CF (2006). "The Max-Min Hill-Climbing Bayesian Network Structure Learning Algorithm". Machine Learning, 65(1), 31-78.
local discovery algorithms, score-based algorithms, constraint-based algorithms.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.