GRaSP (TETRAD)
Module name |
|
Package |
|
Version |
1.10.0 |
Language |
|
Docs |
|
Paper |
Lam et al.[1] |
Graph type |
|
MCMC |
No |
Edge constraints |
|
Data type |
C, D |
Data missingness |
|
Intervention type |
|
Docker |
Greedy relaxation of the sparsest permutation
Greedy relaxation of the sparsest permutation (GRaSP) algorithm.
Some fields described
edgeConstraintsName of the JSON file containing background knowledge
Example JSON
[
{
"id": "grasp-bic",
"score": "sem-bic-score",
"datatype": "continuous",
"test": "fisher-z-test",
"samplePrior": null,
"semBicStructurePrior": 1,
"penaltyDiscount": [
0.8,
1,
1.5
],
"timeout": null,
"edgeConstraints": "edgeConstraints.json"
},
{
"id": "grasp-bdeu",
"score": "bdeu-score",
"test": "chi-square-test",
"datatype": "discrete",
"samplePrior": [
1,
10,
20
],
"semBicStructurePrior": null,
"penaltyDiscount": null,
"timeout": null,
"edgeConstraints": "edgeConstraints.json"
}
]