Estimating high-dimensional directed acyclic graphs with the PC-algorithm (Q3174091)
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: Estimating high-dimensional directed acyclic graphs with the PC-algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimating high-dimensional directed acyclic graphs with the PC-algorithm |
scientific article |
Statements
12 October 2011
0 references
asymptotic consistency
0 references
DAG
0 references
graphical model
0 references
PC-algorithm
0 references
skeleton
0 references
0.8621504306793213
0 references
0.8235598206520081
0 references
0.8234976530075073
0 references
0.8167908787727356
0 references
0.8136762976646423
0 references
