Variable screening for Lasso based on multidimensional indexing
From MaRDI portal
Recommendations
Cites work
- A safe reinforced feature screening strategy for Lasso based on feasible solutions
- Adaptive Lasso for sparse high-dimensional regression models
- Combined \(\ell_1\) and greedy \(\ell_0\) penalized least squares for linear model selection
- Consistent Variable Selection in Linear Models
- Extended Bayesian information criteria for model selection with large model spaces
- False discoveries occur early on the Lasso path
- Fast stepwise regression based on multidimensional indexes
- Gap safe screening rules for sparsity enforcing penalties
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Least angle regression. (With discussion)
- Multidimensional binary search trees used for associative searching
- Optimization with sparsity-inducing penalties
- Statistics for high-dimensional data. Methods, theory and applications.
- Strong Rules for Discarding Predictors in Lasso-Type Problems
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- Sure screening by ranking the canonical correlations
- Ultrahigh dimensional feature selection: beyond the linear model
This page was built for publication: Variable screening for Lasso based on multidimensional indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535782)