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.

Last 30 days

This package has been downloaded 457 times in the last 30 days. Now we're getting somewhere! Enough downloads to populate a lively group chat. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 3 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 5,846 times in the last 365 days. That's a lot of interest! Someone might even write a blog post about it. The day with the most downloads was Feb 12, 2025 with 86 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.