print.FFTrees

Printing function for an FFTrees object

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

print.FFTrees function

<dl><dt>x</dt>
<dd>FFTrees. A FFTrees x created from FFTrees()</dd>
<dt>tree</dt>
<dd>integer. The tree to explore.</dd>
<dt>...</dt>
<dd>additional arguments passed to print.</dd></dl>

Arguments

Prints summary information from an FFTrees object — print.FFTrees

<dl>

<dt>x</dt>
<dd>FFTrees. A FFTrees x created from FFTrees()</dd>


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


<dt>...</dt>
<dd>additional arguments passed to print.</dd>

</dl>

print.FFTrees: Prints summary information from an FFTrees object

Description

Usage

Value

Arguments