FFTrees (Q27741): Difference between revisions
From MaRDI portal
Changed an Item |
Swh import (talk | contribs) SWHID from Software Heritage |
||||||||||||||
| (2 intermediate revisions by 2 users not shown) | |||||||||||||||
| Property / source code repository | |||||||||||||||
| Property / source code repository: https://github.com/cran/FFTrees / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Software Heritage ID | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:9f4d979ba891906e7ae3db447e7876c3ab0e04a8 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:9f4d979ba891906e7ae3db447e7876c3ab0e04a8 / qualifier | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:9f4d979ba891906e7ae3db447e7876c3ab0e04a8 / qualifier | |||||||||||||||
point in time: 9 June 2023
| |||||||||||||||
| links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 17:15, 21 March 2024
Generate, Visualise, and Evaluate Fast-and-Frugal Decision Trees
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FFTrees |
Generate, Visualise, and Evaluate Fast-and-Frugal Decision Trees |
Statements
5 June 2023
0 references
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.
0 references
