BranchGLM (Q72168)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: BranchGLM |
Efficient Best Subset Selection for GLMs via Branch and Bound Algorithms
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | BranchGLM |
Efficient Best Subset Selection for GLMs via Branch and Bound Algorithms |
Statements
28 January 2024
0 references
Performs efficient and scalable glm best subset selection using a novel implementation of a branch and bound algorithm.To speed up the model fitting process, a range of optimizationmethods are implemented in 'RcppArmadillo'. Parallel computation is available using 'OpenMP'.
0 references
