Mathematics – Statistics Theory
Scientific paper
2007-12-11
Electronic Journal of Statistics 2007, Vol. 1, 597-615
Mathematics
Statistics Theory
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.
Bühlmann Peter
Meier Lukas
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-474200