Learning directed acyclic graphs based on sparsest permutations (Q6243035)
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 directed acyclic graphs based on sparsest permutations |
scientific article; zbMATH DE number 7851071
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Learning directed acyclic graphs based on sparsest permutations |
scientific article; zbMATH DE number 7851071 |
Statements
1 July 2013
0 references
math.ST
0 references
cs.LG
0 references
stat.TH
0 references
