fftrees_grow_fan

<code>fftrees_grow_fan</code> is called by <code>fftrees_define</code>
to create new FFTs by applying the <code>fan</code> algorithms
(specifically, either <code>ifan</code> or <code>dfan</code>) to data.

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_grow_fan function

<dl><dt>x</dt>
<dd>An <code>FFTrees</code> object.</dd>
<dt>repeat.cues</dt>
<dd>Can cues be considered/used repeatedly (as logical)?
Default: <code>repeat.cues = TRUE</code>, but only relevant when using the <code>dfan</code> algorithm.</dd></dl>

Arguments

Grow fast-and-frugal trees (FFTs) using the fan algorithms — fftrees_grow_fan

<dl>

<dt>x</dt>
<dd>An <code>FFTrees</code> object.</dd>


<dt>repeat.cues</dt>
<dd>Can cues be considered/used repeatedly (as logical)?
Default: <code>repeat.cues = TRUE</code>, but only relevant when using the <code>dfan</code> algorithm.</dd>

</dl>

fftrees_grow_fan: Grow fast-and-frugal trees (FFTs) using the `fan` algorithms

Description

Usage

Arguments

See Also