Journal
BIOSTATISTICS
Volume 9, Issue 3, Pages 432-441Publisher
OXFORD UNIV PRESS
DOI: 10.1093/biostatistics/kxm045
Keywords
Gaussian covariance; graphical model; L1; lasso
Funding
- NCI NIH HHS [2R01 CA 72028-07] Funding Source: Medline
- NHLBI NIH HHS [N01-HV-28183] Funding Source: Medline
- NIBIB NIH HHS [R01 EB001988, R01 EB001988-13] Funding Source: Medline
Ask authors/readers for more resources
We consider the problem of estimating sparse graphs by a lasso penalty applied to the inverse covariance matrix. Using a coordinate descent procedure for the lasso, we develop a simple algorithm-the graphical lasso-that is remarkably fast: It solves a 1000-node problem (similar to 500000 parameters) in at most a minute and is 30-4000 times faster than competing methods. It also provides a conceptual link between the exact problem and the approximation suggested by Meinshausen and Buhlmann (2006). We illustrate the method on some cell-signaling data from proteomics.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available