Construction of minimal \(d\)-separators in a dependency system (Q844349)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Construction of minimal d-separators in a dependency system |
scientific article; zbMATH DE number 5660043
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of minimal \(d\)-separators in a dependency system |
scientific article; zbMATH DE number 5660043 |
Statements
Construction of minimal \(d\)-separators in a dependency system (English)
0 references
19 January 2010
0 references
probabilistic dependency model
0 references
DAG model
0 references
probabilistic dependence
0 references
acyclic digraph
0 references
conditional independence
0 references
Bayesian network
0 references
\(d\)-separation criterion
0 references
collider
0 references
chain
0 references
locally minimal separator
0 references
finding a locally minimal separator
0 references
identification of edges of a model
0 references
causal faithfulness
0 references
0.8626275658607483
0 references
0.780453085899353
0 references
0.7731852531433105
0 references
0.7400110363960266
0 references
