GLMMLasso: An Algorithm for High-Dimensional Generalized Linear Mixed Models Using L1-Penalization

Details GLMMLasso: An Algorithm for High-Dimensional Generalized Linear Mixed Models Using L1-Penalization GLMMLasso: An Algorithm for High-Dimensional Generalized Linear Mixed Models Using L1-Penalization

2011-09-19

arxiv.org/abs/1109.4003v1

Statistics

Computation

Scientific paper

We propose an L1-penalized algorithm for fitting high-dimensional generalized linear mixed models. Generalized linear mixed models (GLMMs) can be viewed as an extension of generalized linear models for clustered observations. This Lasso-type approach for GLMMs should be mainly used as variable screening method to reduce the number of variables below the sample size. We then suggest a refitting by maximum likelihood based on the selected variables only. This is an effective correction to overcome problems stemming from the variable screening procedure which are more severe with GLMMs. We illustrate the performance of our algorithm on simulated as well as on real data examples. Supplemental materials are available online and the algorithm is implemented in the R package glmmlasso.

Affiliated with

Also associated with

No associations

Rating

GLMMLasso: An Algorithm for High-Dimensional Generalized Linear Mixed Models Using L1-Penalization 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 GLMMLasso: An Algorithm for High-Dimensional Generalized Linear Mixed Models Using L1-Penalization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and GLMMLasso: An Algorithm for High-Dimensional Generalized Linear Mixed Models Using L1-Penalization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96695