BiDAG: Bayesian Inference for Directed Acyclic Graphs (BiDAG): Software for the Efficient Inference and Sampling of Bayesian Networks

Implementation of a collection of MCMC methods for Bayesian structure learning of directed acyclic graphs (DAGs), both from continuous and discrete data. For efficient inference on larger DAGs, the space of DAGs is pruned according to the data. To filter the search space, the algorithm employs a hybrid approach, combining constraint-based learning with search and score. A reduced search space is initially defined on the basis of a skeleton obtained by means of the PC-algorithm, and then iteratively improved with search and score. Search and score is then performed following two approaches: Order MCMC, or Partition MCMC. The BGe score is implemented for continuous data and the BDe score is implemented for binary data. The algorithms may provide the maximum a posteriori (MAP) graph or a sample (a collection of DAGs) from the posterior distribution given the data.

Version: 1.0.1
Imports: Rcpp (≥ 0.12.7), pcalg, methods, stats, utils
LinkingTo: Rcpp
Published: 2017-07-26
Author: Polina Minkina [aut, cre], Jack Kuipers [aut]
Maintainer: Polina Minkina <polina.minkina at bsse.ethz.ch>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: yes
CRAN checks: BiDAG results

Downloads:

Reference manual: BiDAG.pdf
Package source: BiDAG_1.0.1.tar.gz
Windows binaries: r-devel: BiDAG_1.0.1.zip, r-release: BiDAG_1.0.1.zip, r-oldrel: BiDAG_1.0.1.zip
OS X El Capitan binaries: r-release: not available
OS X Mavericks binaries: r-oldrel: BiDAG_1.0.1.tgz
Old sources: BiDAG archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=BiDAG to link to this page.