summary.FFTrees

Returns summary information about an FFTrees x

Create, visualize, and test fast-and-frugal decision trees (FFTs) using methods described in Phillips, Neth, Woike & Gaissmaier. (2017). FFTs are very simple decision trees for
binary classification problems. FFTs can be preferable to more complex algorithms because they are easy to communicate,
require very little information, and are robust against overfitting.

Nathaniel Phillips

FFTrees

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

Hansjoerg Neth

Jan Woike

Wolfgang Gaissmaer

summary.FFTrees function

<dl><dt>object</dt>
<dd>FFTrees.</dd>
<dt>tree</dt>
<dd>integer. The tree to summarise</dd>
<dt>...</dt>
<dd>additional arguments (currently ignored)</dd></dl>

Arguments

Returns summary information about an FFTrees x — summary.FFTrees

<dl>

<dt>object</dt>
<dd>FFTrees.</dd>


<dt>tree</dt>
<dd>integer. The tree to summarise</dd>


<dt>...</dt>
<dd>additional arguments (currently ignored)</dd>

</dl>

summary.FFTrees: Returns summary information about an FFTrees x

Description

Usage

Value

Arguments