Create, visualize, and test fast-and-frugal decision trees (FFTs) using the algorithms and methods described by Phillips, Neth, Woike & Gaissmaier (2017), <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.
Package details |
|
---|---|
Maintainer | Hansjoerg Neth <h.neth@uni.kn> |
License | CC0 |
Version | 2.0.0.9010 |
URL | https://CRAN.R-project.org/package=FFTrees https://github.com/ndphillips/FFTrees/ |
Package repository | View on GitHub |
Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.