Learn R Programming
bnlearn (version 1.6)

hc: Hill-Climbing (HC) learning algorithm

Description

Learn the structure of a Bayesian network using a hill-climbing (HC) greedy search.

Usage

hc(x, start = NULL, whitelist = NULL, blacklist = NULL,
    score = NULL, ..., debug = FALSE, restart = 0,
    perturb = 1, max.iter = Inf, optimized = TRUE)

Arguments

x
a data frame, containing the variables in the model.
start
an object of class bn, the preseeded directed acyclic graph used to initialize the algorithm. If none is specified, an empty one (i.e. without any arc) is used.
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.
score
a character string, the label of the network score to be used in the algorithm. If none is specified, the default score is theBayesian Information Criterion for both discrete and continuous data sets. See
...
additional tuning parameters for the network score. See score for details.
debug
a boolean value. If TRUE a lot of debugging output is printed; otherwise the function is completely silent.
restart
an integer, the number of random restarts.
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.
optimized
a boolean value. See bnlearn-package for details.

Value

  • An object of class bn. See bn-class for details.

References

Korb K, Nicholson AE (2003). Bayesian Artificial Intelligence. Chapman & Hall/CRC.

Margaritis D (2003). Learning Bayesian Network Model Structure from Data. Ph.D. thesis, School of Computer Science, Carnegie-Mellon University, Pittsburgh, PA. Available as Technical Report CMU-CS-03-153.

Daly R, Shen Q (2007). "Methods to Accelerate the Learning of Bayesian Network Structures". In "Proceedings of the 2007 UK Workshop on Computational Intelligence", Imperial College, London.

See Also

constraint-based algorithms, hybrid algorithms, mmpc.