\(\mathsf{PenPC}\): a two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs (Q2805190)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6578764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\mathsf{PenPC}\): a two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs |
scientific article; zbMATH DE number 6578764 |
Statements
10 May 2016
0 references
DAG
0 references
log penalty
0 references
PC-algorithm
0 references
penalized regression
0 references
skeleton
0 references
high-dimensional directed acyclic graphs
0 references
0 references
0 references
\(\mathsf{PenPC}\): a two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs (English)
0 references
0.8621504306793213
0 references
0.7838731408119202
0 references
0.7728981971740723
0 references
0.7726444602012634
0 references
0.7615872025489807
0 references
