BiDAG
2.1.4Bayesian Inference for Directed Acyclic Graphs
Overview
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 or categorical 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. All algorithms are also applicable for structure learning and sampling for dynamic Bayesian networks. References: J. Kuipers, P. Suter, G. Moffa (2022) doi:10.1080/10618600.2021.2020127, N. Friedman and D. Koller (2003) doi:10.1023/A:1020249912095, J. Kuipers and G. Moffa (2017) doi:10.1080/01621459.2015.1133426, M. Kalisch et al. (2012) doi:10.18637/jss.v047.i11, D. Geiger and D. Heckerman (2002) doi:10.1214/aos/1035844981, P. Suter, J. Kuipers, G. Moffa, N.Beerenwinkel (2023) doi:10.18637/jss.v105.i09.
Install
Health
- NOTE r-devel-linux-x86_64-debian-clang
- NOTE r-devel-linux-x86_64-debian-gcc
- NOTE r-devel-linux-x86_64-fedora-clang
- NOTE r-devel-linux-x86_64-fedora-gcc
- NOTE2026-04-2210 OK · 4 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- ERROR2026-04-189 OK · 4 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE
- NOTE2026-03-1010 OK · 4 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
Documentation
- Examples that run
- 80%
- Documented parameters
- 97%
- Return-value docs
- 97%
- References docs
- 28%
Downloads
Dependencies
Code & Tests
Datasets
People & History
Author records are not tracked yet for this package.
23 releases. Pick two to compare their code metrics. R releases are shown for context.
- RR 4.6.0 released · 2026-04-24
- RR 4.5.0 released · 2025-04-11
- RR 4.4.0 released · 2024-04-24
- 2.1.4Latest
- RR 4.3.0 released · 2023-04-21
- 2.1.32023-01-23 · diff ↗
- 2.1.22022-12-21 · diff ↗
- 2.1.12022-08-05 · diff ↗
- 2.1.02022-06-27 · diff ↗
- 2.0.92022-06-20 · diff ↗
- 2.0.72022-05-16 · diff ↗
- 2.0.62022-05-09 · diff ↗
- RR 4.2.0 released · 2022-04-22
- 2.0.52022-04-13 · diff ↗
- 2.0.42021-11-30 · diff ↗
- 2.0.32021-07-28 · diff ↗
Show 17 earlier events
- RR 4.1.0 released · 2021-05-18
- 2.0.22021-04-30 · diff ↗
- 2.0.12021-04-28 · diff ↗
- 2.0.02021-02-15 · diff ↗
- 1.4.12020-07-14 · diff ↗
- RR 4.0.0 released · 2020-04-24
- 1.3.42020-04-12 · diff ↗
- 1.3.02020-02-19 · diff ↗
- 1.2.02019-08-19 · diff ↗
- RR 3.6.0 released · 2019-04-26
- 1.1.22018-05-24 · diff ↗
- RR 3.5.0 released · 2018-04-23
- 1.1.12018-03-16 · diff ↗
- 1.0.22017-09-08 · diff ↗
- 1.0.12017-07-26 · diff ↗
- 1.0.02017-07-19
- RR 3.4.0 released · 2017-04-21
Package metadata
- First published
- 2017-07-19
- Total releases
- 23 / 9 yrs
- License
- GPL (>= 2) OSI
- Minimum R
- ≥ 3.5.0
- Bundled data
- 915 KB / 13 files
- Download size
- 1.0 MB
- Installed size
- not tracked yet
- With dependencies
- not tracked yet
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("BiDAG")Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-08-16, which the citation names so these numbers can be found later. More on citing and the projects behind them.