Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/201523 
Year of Publication: 
2017
Citation: 
[Journal:] Judgment and Decision Making [ISSN:] 1930-2975 [Volume:] 12 [Issue:] 4 [Publisher:] Society for Judgment and Decision Making [Place:] Berwyn [Year:] 2017 [Pages:] 344-368
Publisher: 
Society for Judgment and Decision Making, Berwyn
Abstract: 
Fast-and-frugal trees (FFTs) are simple algorithms that facilitate efficient and accurate decisions based on limited information. But despite their successful use in many applied domains, there is no widely available toolbox that allows anyone to easily create, visualize, and evaluate FFTs. We fill this gap by introducing the R package FFTrees. In this paper, we explain how FFTs work, introduce a new class of algorithms called fan for constructing FFTs, and provide a tutorial for using the FFTreespackage. We then conduct a simulation across ten real-world datasets to test how well FFTs created by FFTreescan predictdata. Simulation results show that FFTs created by FFTreescan predict data as well as popular classification algorithms such as regression and random forests, while remaining simple enough for anyone to understand and use.
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.