Standard and robust estimation of the equivalence class of
a Directed Acyclic Graph (DAG) via the PC-Algorithm. The
equivalence class is represented by its (unique) Completete
Partially Directed Acyclic Graph (CPDAG). Furthermore, a PAG
instead of a CPDAG can be estimated if latent variables and/or
selection variables are assumed to be present. FCI and RFCI are
available for estimating PAGs. Functions for causal inference
using the IDA algorithm (based on do-calculus of Judea Pearl)
are provided for CPDAGs.
| Version: |
1.1-6 |
| Depends: |
methods, abind, sfsmisc |
| Imports: |
graph, RBGL, ggm, corpcor, robustbase, graphics, vcd |
| Suggests: |
MASS, Matrix, Rgraphviz |
| Published: |
2013-03-22 |
| Author: |
Markus Kalisch, Martin Maechler, Diego Colombo |
| Maintainer: |
Markus Kalisch <kalisch at stat.math.ethz.ch> |
| License: |
GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: |
http://pcalg.r-forge.r-project.org/ |
| NeedsCompilation: |
no |
| Citation: |
pcalg citation info |
| In views: |
gR |
| CRAN checks: |
pcalg results |