Nothing
BranchGLM: Efficient Best Subset Selection for GLMs via Branch and Bound Algorithms
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 optimization methods are implemented in 'RcppArmadillo'. Parallel computation is available using 'OpenMP'.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Jacob Seedorff [aut, cre] |
| Maintainer | Jacob Seedorff <jacob-seedorff@uiowa.edu> |
| License | Apache License (>= 2) |
| Version | 3.0.1 |
| URL | https://github.com/JacobSeedorff21/BranchGLM |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the BranchGLM package in your browser
Any scripts or data that you put into this service are public.
