Structure learning of bow-free acyclic path diagrams (BAPs) using greedy search to maximise a penalised Gaussian likelihood.
|Package repository||View on GitHub|
Install the latest version of this package by entering the following in R:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.