FFTrees-package

<img src="figures/logo.png?package=FFTrees&version=2.1.0" style="float: right" alt="logo" width="120">
Create, visualize, and test fast-and-frugal decision trees (FFTs) using the algorithms and methods described by Phillips, Neth, Woike &amp; Gaissmaier (2017), 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.

internal

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.

Hansjoerg Neth

FFTrees

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

Nathaniel Phillips

Jan Woike

Wolfgang Gaissmaier

FFTrees-package function

Maintainer: Hansjoerg Neth <a href="/link/h.neth%40uni.kn?package=FFTrees&version=2.1.0" data-mini-rdoc="FFTrees::h.neth@uni.kn">h.neth@uni.kn</a> (<a href="https://orcid.org/0000-0001-5427-3141">ORCID</a>)
Authors:<ul>
<li>Nathaniel Phillips <a href="/link/Nathaniel.D.Phillips.is%40gmail.com?package=FFTrees&version=2.1.0" data-mini-rdoc="FFTrees::Nathaniel.D.Phillips.is@gmail.com">Nathaniel.D.Phillips.is@gmail.com</a> (<a href="https://orcid.org/0000-0002-8969-7013">ORCID</a>)</li>
<li>Jan Woike (<a href="https://orcid.org/0000-0002-6816-121X">ORCID</a>)</li>
<li>Wolfgang Gaissmaier (<a href="https://orcid.org/0000-0001-6273-178X">ORCID</a>)</li>
</ul>

Author

<img src='figures/logo.png' style='float: right' alt='logo' width='120' />
Create, visualize, and test fast-and-frugal decision trees (FFTs) using the algorithms and methods described by Phillips, Neth, Woike &amp; Gaissmaier (2017), 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.

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

Maintainer: Hansjoerg Neth <a href='mailto:h.neth@uni.kn'>h.neth@uni.kn</a> (<a href='https://orcid.org/0000-0001-5427-3141'>ORCID</a>)
Authors:<ul>
<li>Nathaniel Phillips <a href='mailto:Nathaniel.D.Phillips.is@gmail.com'>Nathaniel.D.Phillips.is@gmail.com</a> (<a href='https://orcid.org/0000-0002-8969-7013'>ORCID</a>)</li>
<li>Jan Woike (<a href='https://orcid.org/0000-0002-6816-121X'>ORCID</a>)</li>
<li>Wolfgang Gaissmaier (<a href='https://orcid.org/0000-0001-6273-178X'>ORCID</a>)</li>
</ul>

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

Description

Arguments

Author

See Also