Bayesian network learning using the PCHC algorithm. PCHC stands for PC Hill-Climbing. It is a new hybrid algorithm that used PC to construct the skeleton of the BN and then utilizes the Hill-Climbing greedy search. The relevant paper has been submitted and is currently in revision.
| Version: | 0.1 |
| Depends: | R (≥ 3.6.0) |
| Imports: | bnlearn, Rfast, robustbase, stats |
| Published: | 2020-07-06 |
| Author: | Michail Tsagris [aut, cre] |
| Maintainer: | Michail Tsagris <mtsagris at uoc.gr> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| CRAN checks: | pchc results |
| Reference manual: | pchc.pdf |
| Package source: | pchc_0.1.tar.gz |
| Windows binaries: | r-devel: pchc_0.1.zip, r-release: pchc_0.1.zip, r-oldrel: pchc_0.1.zip |
| macOS binaries: | r-release: pchc_0.1.tgz, r-oldrel: pchc_0.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=pchc to link to this page.