Feature selection algorithms in generalized additive models under concurvity
From MaRDI portal
Publication:6567405
Cites work
- Algorithm AS 136: A K-Means Clustering Algorithm
- Algorithmic Learning Theory
- An introduction to statistical learning. With applications in R
- Boosting additive models using component-wise P-splines
- Component selection and smoothing in multivariate nonparametric regression
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Fast stable restricted maximum likelihood and marginal likelihood estimation of semiparametric generalized linear models
- Generalized Additive Modeling with Implicit Variable Selection by Likelihood‐Based Boosting
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 3145583 (Why is no real title available?)
- scientific article; zbMATH DE number 47282 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6734253 (Why is no real title available?)
- On model selection consistency of the elastic net when p n
- On quantile quantile plots for generalized linear models
- Practical variable selection for generalized additive models
- Simultaneous selection of variables and smoothing parameters in structured additive regression models
- When do stepwise algorithms meet subset selection criteria?
This page was built for publication: Feature selection algorithms in generalized additive models under concurvity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567405)