Implementation of the algorithm introduced in Shah, R. D. (2016) <http://www.jmlr.org/papers/volume17/13-515/13-515.pdf>. Data with thousands of predictors can be handled. The algorithm performs sequential Lasso fits on design matrices containing increasing sets of candidate interactions. Previous fits are used to greatly speed up subsequent fits so the algorithm is very efficient.
| Version: | 0.1.2 |
| Imports: | Matrix, parallel, Rcpp |
| LinkingTo: | Rcpp |
| Published: | 2017-04-04 |
| Author: | Rajen Shah [aut, cre] |
| Maintainer: | Rajen Shah <r.shah at statslab.cam.ac.uk> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | www.jmlr.org/papers/volume17/13-515/13-515.pdf |
| NeedsCompilation: | yes |
| CRAN checks: | LassoBacktracking results |
| Reference manual: | LassoBacktracking.pdf |
| Package source: | LassoBacktracking_0.1.2.tar.gz |
| Windows binaries: | r-devel: LassoBacktracking_0.1.2.zip, r-release: LassoBacktracking_0.1.2.zip, r-oldrel: LassoBacktracking_0.1.2.zip |
| macOS binaries: | r-release: LassoBacktracking_0.1.2.tgz, r-oldrel: LassoBacktracking_0.1.2.tgz |
| Old sources: | LassoBacktracking archive |
Please use the canonical form https://CRAN.R-project.org/package=LassoBacktracking to link to this page.