Bayesian Inference for Causal Networks

A Bayesian hybrid approach for inferring Directed Acyclic Graphs (DAGs) for continuous, discrete, and mixed data. The algorithm can use the graph inferred by another more efficient graph inference method as input; the input graph may contain false edges or undirected edges but can help reduce the search space to a more manageable size. A Bayesian Markov chain Monte Carlo algorithm is then used to infer the probability of direction and absence for the edges in the network. References: Martin and Fu (2019) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.2.0 by Evan A Martin, a year ago

Browse source code at

Authors: Evan A Martin [aut, cre] , Audrey Qiuyan Fu [aut]

Documentation:   PDF Manual  

GPL-3 | file LICENSE license

Imports egg, ggplot2, gtools, igraph, MASS, methods

Suggests testthat

See at CRAN