figsr
Fast Interpretable Greedy-Tree Sums for Tree Ensembles
Flexible, interpretable machine learning algorithm for additive tree sums (FIGS). Fits a sum of shallow classification and regression trees (CART) by greedily minimizing residual impurity, growing a new tree or deepening an existing one at each step, whichever reduces the residuals most. Supports regression and two-class classification, variable importance, bootstrap ensembling and seamless integration with 'parsnip' and 'tidymodels' workflows. The method is described in Tan et al. (2023) <doi:10.1073/pnas.2310151122>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.1 |
rolling linux/jammy R-4.5 | figsr_0.1.1.tar.gz |
105.0 KiB |
0.1.1 |
rolling linux/noble R-4.5 | figsr_0.1.1.tar.gz |
105.0 KiB |
0.1.1 |
rolling source/ R- | figsr_0.1.1.tar.gz |
42.0 KiB |
0.1.1 |
latest linux/jammy R-4.5 | figsr_0.1.1.tar.gz |
105.0 KiB |
0.1.1 |
latest linux/noble R-4.5 | figsr_0.1.1.tar.gz |
105.0 KiB |
0.1.1 |
latest source/ R- | figsr_0.1.1.tar.gz |
42.0 KiB |
0.1.1 |
2026-04-23 source/ R- | figsr_0.1.1.tar.gz |
0 B |