Learning high-dimensional directed acyclic graphs with latent and selection variables (Q450035)
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: Learning high-dimensional directed acyclic graphs with latent and selection variables |
scientific article; zbMATH DE number 6075616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning high-dimensional directed acyclic graphs with latent and selection variables |
scientific article; zbMATH DE number 6075616 |
Statements
Learning high-dimensional directed acyclic graphs with latent and selection variables (English)
0 references
3 September 2012
0 references
causal structure learning
0 references
FCI algorithm
0 references
RFCI algorithm
0 references
maximal ancestral graphs (MAGs)
0 references
partial ancestral graphs (PAGs)
0 references
high-dimensionality
0 references
sparsity
0 references
consistency
0 references
0.8410553932189941
0 references
0.8063253164291382
0 references
0.7977095246315002
0 references
0.7953575253486633
0 references
