datasets

Create, visualize, and test fast-and-frugal decision trees (FFTs). 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

car function

A data frame containing 1728 rows and 7 columns<dl class="dl-horizontal">
 <dt>buying.price</dt><dd>Numeric</dd>
 <dt>maint.price</dt><dd>Factor</dd>
 <dt>doors</dt><dd>Factor</dd>
 <dt>persons</dt><dd>Numeric</dd>
 <dt>luggage</dt><dd>Numeric</dd>
 <dt>safety</dt><dd>Factor</dd>
 <dt>acceptability</dt><dd>Factor</dd>...
</dl>

Format

Car acceptability data — car

Car acceptability data

car: Car acceptability data

Description

Usage

Arguments

Format