FBFsearch: Algorithm for Searching the Space of Gaussian Directed Acyclic
Graph Models Through Moment Fractional Bayes Factors
We propose an objective Bayesian algorithm for searching the space of Gaussian directed acyclic graph (DAG) models. The algorithm proposed makes use of moment fractional Bayes factors (MFBF) and thus it is suitable for learning sparse graph. The algorithm is implemented by using Armadillo: an open-source C++ linear algebra library.
| Version: |
1.2 |
| Imports: |
Rcpp (≥ 0.12.7) |
| LinkingTo: |
Rcpp, RcppArmadillo |
| Published: |
2022-08-08 |
| Author: |
Davide Altomare, Guido Consonni and Luca La Rocca |
| 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 |
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=FBFsearch
to link to this page.