BranchGLM

Efficient Best Subset Selection for GLMs via Branch and Bound Algorithms

CRAN Package

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

Documentation

Team

Insights

Last 30 days

Last 365 days

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Data provided by CRAN

Binaries

Dependencies

  • Imports1 package
  • Suggests3 packages
  • Linking To3 packages