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. Functions for
causal inference using the IDA algorithm (based on do-calculus
of Judea Pearl) are provided for CPDAGs.
| Version: |
1.1-2 |
| Depends: |
methods, abind, corpcor, sfsmisc |
| Imports: |
graph, RBGL, ggm, robustbase, graphics, vcd |
| Suggests: |
MASS, graph, Rgraphviz, ggm |
| Published: |
2010-10-27 |
| Author: |
Markus Kalisch, Martin Maechler, Diego Colombo |
| Maintainer: |
Markus Kalisch <kalisch at stat.math.ethz.ch> |
| License: |
GPL (≥ 2) |
| URL: |
http://pcalg.r-forge.r-project.org/ |
| In views: |
gR |
| CRAN checks: |
pcalg results |