Feature selection algorithms in generalized additive models under concurvity
From MaRDI portal
Publication:6567405
DOI10.1007/S00180-022-01292-7MaRDI QIDQ6567405FDOQ6567405
Publication date: 5 July 2024
Published in: Computational Statistics (Search for Journal in Brave)
feature selectionboostingregularizationharmony search algorithmgeneralized additive modelgenetic algorithm
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- An Introduction to Statistical Learning
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Title not available (Why is that?)
- Fast Stable Restricted Maximum Likelihood and Marginal Likelihood Estimation of Semiparametric Generalized Linear Models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simultaneous selection of variables and smoothing parameters in structured additive regression models
- Algorithmic Learning Theory
- Practical variable selection for generalized additive models
- Title not available (Why is that?)
- Generalized Additive Modeling with Implicit Variable Selection by Likelihood‐Based Boosting
- Component selection and smoothing in multivariate nonparametric regression
- Boosting additive models using component-wise P-splines
- On model selection consistency of the elastic net when \(p \gg n\)
- On quantile quantile plots for generalized linear 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)
