Sparse inverse covariance estimation with the lasso

Statistics – Methodology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

submitted

Scientific paper

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 that is remarkably fast: in the worst cases, it solves a 1000 node problem (~500,000 parameters) in about a minute, and is 50 to 2000 times faster than competing methods. It also provides a conceptual link between the exact problem and the approximation suggested by Meinhausen and Buhlmann (2006). We illustrate the method on some cell-signaling data from proteomics.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Sparse inverse covariance estimation with the lasso does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sparse inverse covariance estimation with the lasso, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse inverse covariance estimation with the lasso will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-125888

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.