FFTrees : A toolbox to create, visualize, and evaluate fast-and-frugal decision trees
FFTrees : A toolbox to create, visualize, and evaluate fast-and-frugal decision trees
Loading...
Date
2017
Authors
Editors
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
International patent number
Link to the license
EU project number
Project
Open Access publication
Collections
Title in another language
Publication type
Journal article
Publication status
Published
Published in
Judgment and Decision Making ; 12 (2017), 4. - pp. 344-368. - eISSN 1930-2975
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 FFTrees package. We then conduct a simulation across ten real-world datasets to test how well FFTs created by FFTrees can predict data. Simulation results show that FFTs created by FFTrees can predict data as well as popular classification algorithms such as regression and random forests, while remaining simple enough for anyone to understand and use.
Summary in another language
Subject (DDC)
150 Psychology
Keywords
decision trees, heuristics, prediction
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690
PHILLIPS, Nathaniel D., Hansjörg NETH, Jan K. WOIKE, Wolfgang GAISSMAIER, 2017. FFTrees : A toolbox to create, visualize, and evaluate fast-and-frugal decision trees. In: Judgment and Decision Making. 12(4), pp. 344-368. eISSN 1930-2975BibTex
@article{Phillips2017FFTre-39832, year={2017}, title={FFTrees : A toolbox to create, visualize, and evaluate fast-and-frugal decision trees}, url={http://journal.sjdm.org/17/17217/jdm17217.pdf}, number={4}, volume={12}, journal={Judgment and Decision Making}, pages={344--368}, author={Phillips, Nathaniel D. and Neth, Hansjörg and Woike, Jan K. and Gaissmaier, Wolfgang} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39832"> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:rights>Attribution 3.0 Unported</dc:rights> <dc:creator>Gaissmaier, Wolfgang</dc:creator> <dc:language>eng</dc:language> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-10T11:54:22Z</dc:date> <dcterms:abstract xml:lang="eng">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 FFTrees package. We then conduct a simulation across ten real-world datasets to test how well FFTs created by FFTrees can predict data. Simulation results show that FFTs created by FFTrees can predict data as well as popular classification algorithms such as regression and random forests, while remaining simple enough for anyone to understand and use.</dcterms:abstract> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/43"/> <dc:creator>Phillips, Nathaniel D.</dc:creator> <dcterms:title>FFTrees : A toolbox to create, visualize, and evaluate fast-and-frugal decision trees</dcterms:title> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/39832"/> <dcterms:issued>2017</dcterms:issued> <dc:contributor>Phillips, Nathaniel D.</dc:contributor> <dc:creator>Woike, Jan K.</dc:creator> <dc:contributor>Neth, Hansjörg</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/43"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Woike, Jan K.</dc:contributor> <dc:creator>Neth, Hansjörg</dc:creator> <dc:contributor>Gaissmaier, Wolfgang</dc:contributor> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39832/1/Phillips_0-420978.pdf"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39832/1/Phillips_0-420978.pdf"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-10T11:54:22Z</dcterms:available> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/3.0/"/> </rdf:Description> </rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
URL of original publication
Test date of URL
2017-08-10
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes