heart.cost

Cue costs for the heartdisease dataa

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

heart.cost function

A data frame containing 153 rows and 14 columns<dl class="dl-horizontal">
 <dt>cue</dt><dd>The name of the cue</dd>
 <dt>cost</dt><dd>The cost of the cue</dd>...
</dl>

Format

Cue costs for the heartdisease dataa — heart.cost

Cue costs for the heartdisease dataa

heart.cost: Cue costs for the heartdisease dataa

Description

Usage

Arguments

Format