We propose an objective Bayesian algorithm for searching the space of Gaussian directed acyclic graph (DAG) models. The algorithm uses moment fractional Bayes factors (MFBF) and is suitable for learning sparse graphs. The algorithm is implemented using Armadillo, an open-source C++ linear algebra library.
| Version: | 1.3 |
| Imports: | Rcpp (≥ 0.12.7) |
| LinkingTo: | Rcpp, RcppArmadillo |
| Published: | 2025-10-26 |
| DOI: | 10.32614/CRAN.package.FBFsearch |
| Author: | Davide Altomare [aut, cre], Guido Consonni [aut], Luca La Rocca [aut] |
| Maintainer: | Davide Altomare <davide.altomare at gmail.com> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | yes |
| In views: | GraphicalModels |
| CRAN checks: | FBFsearch results |
| Reference manual: | FBFsearch.html , FBFsearch.pdf |
| Package source: | FBFsearch_1.3.tar.gz |
| Windows binaries: | r-devel: FBFsearch_1.2.zip, r-release: FBFsearch_1.2.zip, r-oldrel: FBFsearch_1.3.zip |
| macOS binaries: | r-release (arm64): FBFsearch_1.3.tgz, r-oldrel (arm64): FBFsearch_1.3.tgz, r-release (x86_64): FBFsearch_1.3.tgz, r-oldrel (x86_64): FBFsearch_1.3.tgz |
| Old sources: | FBFsearch archive |
Please use the canonical form https://CRAN.R-project.org/package=FBFsearch to link to this page.