Regularization and model selection with categorical covariates

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The challenge in regression problems with categorical covariates is the high number of parameters involved. Common regularization methods like the Lasso, which allow for selection of predictors, are typically designed for metric predictors. If independent variables are categorical, selection strategies should be based on modified penalties. For categorical predictor variables with many categories a useful strategy is to search for clusters of categories with similar effects. We focus on generalized linear models and present L1-penalty approaches for factor selection and clustering of categories. The methods proposed are investigated in simulation studies and applied to a real world classification problem. © Springer International Publishing Switzerland 2013.

Cite

CITATION STYLE

APA

Gertheiss, J., Stelz, V., & Tutz, G. (2013). Regularization and model selection with categorical covariates. In Studies in Classification, Data Analysis, and Knowledge Organization (pp. 215–222). Kluwer Academic Publishers. https://doi.org/10.1007/978-3-319-00035-0_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free