FFTrees-package: FFTrees: Generate, Visualise, and Evaluate Fast-and-Frugal...

In ndphillips/FFTrees: Generate, Visualise, and Evaluate Fast-and-Frugal Decision Trees

FFTrees: Generate, Visualise, and Evaluate Fast-and-Frugal Decision Trees

Description

Create, visualize, and test fast-and-frugal decision trees (FFTs) using the algorithms and methods described by Phillips, Neth, Woike & Gaissmaier (2017), \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1017/S1930297500006239")}. FFTs are simple and transparent decision trees for solving binary classification problems. FFTs can be preferable to more complex algorithms because they require very little information, are easy to understand and communicate, and are robust against overfitting.

Author(s)

Maintainer: Hansjoerg Neth [e-mail] (ORCID)

Authors:

• Nathaniel Phillips [e-mail] (ORCID)

• Jan Woike (ORCID)

• Wolfgang Gaissmaier (ORCID)

See Also

Useful links:

• https://CRAN.R-project.org/package=FFTrees

• https://github.com/ndphillips/FFTrees/

• Report bugs at https://github.com/ndphillips/FFTrees/issues

ndphillips/FFTrees documentation built on April 25, 2024, 1:07 a.m.