An implementation of ranked sparsity methods, including penalized regression methods such as the sparsity-ranked lasso, its non-convex alternatives, and elastic net, as well as the sparsity-ranked Bayesian Information Criterion. As described in Peterson and Cavanaugh (2022) <doi:10.1007/s10182-021-00431-7>, ranked sparsity is a philosophy with methods primarily useful for variable selection in the presence of prior informational asymmetry, which occurs in the context of trying to perform variable selection in the presence of interactions and/or polynomials. Ultimately, this package attempts to facilitate dealing with cumbersome interactions and polynomials while not avoiding them entirely. Typically, models selected under ranked sparsity principles will also be more transparent, having fewer falsely selected interactions and polynomials than other methods.
Version: 0.3.2 Depends: R (≥ 3.5) Imports: ncvreg, rlang, magrittr, dplyr, recipes (≥ 1.0.0) Suggests: survival, knitr, rmarkdown, kableExtra, testthat, covr, modeldata, MASS Published: 2025-04-14 DOI: 10.32614/CRAN.package.sparseR Author: Ryan Andrew Peterson [aut, cre] Maintainer: Ryan Andrew Peterson <ryan.a.peterson at cuanschutz.edu> License: GPL-3 URL: https://petersonr.github.io/sparseR/, https://github.com/petersonR/sparseR/ NeedsCompilation: no Citation: sparseR citation info Materials: README NEWS CRAN checks: sparseR results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=sparseR 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