Inferring large graphs using \(\ell_1\)-penalized likelihood (Q1704026)
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: Inferring large graphs using \(\ell_1\)-penalized likelihood |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inferring large graphs using \(\ell_1\)-penalized likelihood |
scientific article |
Statements
Inferring large graphs using \(\ell_1\)-penalized likelihood (English)
0 references
8 March 2018
0 references
directed acyclic graphs
0 references
Lasso
0 references
convex program
0 references
optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
