Best Orthogonalized Subset Selection (BOSS) is a least-squares (LS) based subset selection method, that performs best subset selection upon an orthogonalized basis of ordered predictors, with the computational effort of a single ordinary LS fit. This package provides a highly optimized implementation of BOSS and estimates a heuristic degrees of freedom for BOSS, which can be plugged into an information criterion (IC) such as AICc in order to select the subset from candidates. It provides various choices of IC, including AIC, BIC, AICc, Cp and GCV. It also implements the forward stepwise selection (FS) with no additional computational cost, where the subset of FS is selected via cross-validation (CV). CV is also an option for BOSS. For details see: Tian, Hurvich and Simonoff (2021), "On the Use of Information Criteria for Subset Selection in Least Squares Regression", <doi:10.48550/arXiv.1911.10191>.
Version: 0.2.0 Depends: R (≥ 3.5.0) Imports: glmnet, Matrix, Rcpp, stats LinkingTo: Rcpp, RcppArmadillo Suggests: devtools, ISLR, kableExtra, knitr, MASS, rmarkdown, sparsenet Published: 2021-03-06 DOI: 10.32614/CRAN.package.BOSSreg Author: Sen Tian [aut, cre], Clifford Hurvich [aut], Jeffrey Simonoff [aut] Maintainer: Sen Tian <stian at stern.nyu.edu> BugReports: https://github.com/sentian/BOSSreg/issues License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] URL: https://github.com/sentian/BOSSreg NeedsCompilation: yes Materials: NEWS CRAN checks: BOSSreg results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=BOSSreg to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4