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'.

Package details

AuthorJacob Seedorff [aut, cre]
MaintainerJacob Seedorff <>
LicenseApache License (>= 2)
Package repositoryView 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.

BranchGLM documentation built on June 22, 2024, 9:32 a.m.