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.
|Author||Rajen Shah [aut, cre]|
|Date of publication||2017-04-04 08:48:43 UTC|
|Maintainer||Rajen Shah <firstname.lastname@example.org>|
|License||GPL (>= 2)|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.