PC (gCastle)
Module name |
|
Package |
|
Version |
1.0.3 |
Language |
|
Docs |
|
Paper |
Kalisch and Bühlman[1] |
Graph type |
|
MCMC |
No |
Edge constraints |
No |
Data type |
C |
Data missingness |
|
Intervention type |
|
Docker |
PC
A classic causal discovery algorithm based on conditional independence tests.
Example
Config file: gcastle.json
Command:
snakemake --cores all --use-apptainer --configfile config/gcastle.json
Fig. 50 shows the pattern graph’s FP/P vs. TP/P benchmark results for 12 gCastle algorithms (and comparison with BOSS (TETRAD) and Iterative MCMC (BiDAG)). The benchmark is based on 5 datasets corresponding to 5 realisations of a 20-variable random Gaussian SEM with Erdős-Rényi structure (expected degree 4, max parents 5). Each dataset contains 300 standardized samples. The SEM parameters are uniformly sampled from [0.25, 1].
Fig. 50 FP/P vs. TP/P for gCastle algorithms.
Example JSON
[
{
"id": "gcastle_pc",
"variant": "original",
"alpha": 0.05,
"ci_test": "fisherz",
"timeout": null
}
]