Group linear algorithm with sparse principal decomposition: a variable selection and clustering method for generalized linear models
From MaRDI portal
Publication:6099122
DOI10.1007/s00362-022-01313-zMaRDI QIDQ6099122
Rosa Elvira Lillo, Juan C. Laria, M. Carmen Aguilera-Morillo
Publication date: 19 June 2023
Published in: Statistical Papers (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A Cluster Elastic Net for Multivariate Regression
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Correlated variables in regression: clustering and sparse estimation
- Group variable selection via a hierarchical lasso and its oracle property
- Sparse principal component analysis via regularized low rank matrix approximation
- Modeling survival data: extending the Cox model
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- MCEN: a method of simultaneous variable selection and clustering for high-dimensional multinomial regression
- Applied Survival Analysis Using R
- An Iterative Sparse-Group Lasso
- Adaptive elastic-net selection in a quantile model with diverging number of variable groups
- Feature Selection by Canonical Correlation Search in High-Dimensional Multiresponse Models With Complex Group Structures
- Stringing High-Dimensional Data for Functional Analysis
- Regularization and Variable Selection Via the Elastic Net
- Strong Rules for Discarding Predictors in Lasso-Type Problems
- Prediction by Supervised Principal Components
This page was built for publication: Group linear algorithm with sparse principal decomposition: a variable selection and clustering method for generalized linear models
