FFTrees

From MaRDI portal
Software:27741



swMATH15869CRANFFTreesMaRDI QIDQ27741

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

Jan K Woike, Nathaniel Phillips, Wolfgang Gaissmaier, Hansjoerg Neth

Last update: 5 June 2023

Copyright license: CC0

Software version identifier: 1.9.0, 1.0.1, 1.1.0, 1.1.1, 1.1.3, 1.1.4, 1.1.6, 1.1.8, 1.2.2, 1.2.3, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.0, 1.5.5, 1.6.5, 1.6.6, 1.7.0, 1.7.5, 1.8.0, 2.0.0

Source code repository: https://github.com/cran/FFTrees

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.





This page was built for software: FFTrees