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) <arXiv:1909.10678>.
|Author||Evan A Martin [aut, cre], Audrey Qiuyan Fu [aut]|
|Maintainer||Evan A Martin <firstname.lastname@example.org>|
|License||GPL-3 | file LICENSE|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.