cnowzohour/greedyBAPs: Greedy BAP Learning Using Penalised Maximum Likelihood Score
Structure learning of bow-free acyclic path diagrams (BAPs) using greedy search to maximise a penalised Gaussian likelihood.
Getting started
Browse package contents
Package details |
|
|---|---|
| Maintainer | |
| License | GPL-3 |
| Version | 0.0.0.9000 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
