Smoothing $\ell_1$-penalized estimators for high-dimensional time-course data

Mathematics – Statistics Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published in at http://dx.doi.org/10.1214/07-EJS103 the Electronic Journal of Statistics (http://www.i-journals.org/ejs/) by t

Scientific paper

10.1214/07-EJS103

When a series of (related) linear models has to be estimated it is often appropriate to combine the different data-sets to construct more efficient estimators. We use $\ell_1$-penalized estimators like the Lasso or the Adaptive Lasso which can simultaneously do parameter estimation and model selection. We show that for a time-course of high-dimensional linear models the convergence rates of the Lasso and of the Adaptive Lasso can be improved by combining the different time-points in a suitable way. Moreover, the Adaptive Lasso still enjoys oracle properties and consistent variable selection. The finite sample properties of the proposed methods are illustrated on simulated data and on a real problem of motif finding in DNA sequences.

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

Smoothing $\ell_1$-penalized estimators for high-dimensional time-course data 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 Smoothing $\ell_1$-penalized estimators for high-dimensional time-course data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smoothing $\ell_1$-penalized estimators for high-dimensional time-course data will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-474200

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