Package: figsr 0.2.0

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>.

Authors:João Paulo Assis Bonifácio [aut, cre, cph], Geraldo Magela da Cruz Pereira [aut, cph], Pedro Mambelli Fernandes [aut, cph], João Vitor Andrade Alves de Souza [aut, cph]