• Keine Ergebnisse gefunden

Making robust classification decisions : constructing and evaluating Fast and Frugal Trees (FFTs)

N/A
N/A
Protected

Academic year: 2022

Aktie "Making robust classification decisions : constructing and evaluating Fast and Frugal Trees (FFTs)"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Making Robust Classification Decisions:

Constructing and Evaluating Fast and Frugal Trees (FFTs)

Hansjörg Neth, Uwe Czienskowski, Lael J. Schooler {neth, sciencec, schooler}@mpib-berlin.mpg.de

Center for Adaptive Behavior and Cognition

Max Planck Institute for Human Development, Berlin, Germany

Kevin Gluck kevin.gluck@us.af.mil Air Force Research Laboratory Wright-Patterson AFB, OH, USA

Abstract

Fast and Frugal Trees (FFTs) are a quintessential family of simple heuristics that allow effective and efficient binary clas- sification decisions and often perform remarkably well when compared to more complex methods. This half-day tutorial will familiarize participants with examples of FFTs and elu- cidate the theoretical link between FFTs and signal detection theory (SDT). A range of presentations, practical exercises and interactive tools will enable participants to construct and eval- uate FFTs for different data sets.

Keywords:Fast and frugal trees; binary classifications; simple heuristics; signal detection theory; validity; robustness

Motivation

Many real-world problems call for binary classification de- cisions. We may want to predict whether a partnership is promising, whether an investment is profitable, or whether a patient is in peril. Such classifications have important con- sequences, yet are typically made under time-pressure and uncertainty. Predictions of experts and laypeople in the real world require robust decision strategies that work swiftly and reliably on the basis of limited information.

Fast and Frugal Trees(FFTs) allow efficient and effective binary classification decisions by sequentially attending to a list of diagnostic cues (Martignon, Vitouch, Takezawa, &

Forster, 2003; Martignon, Katsikopoulos, & Woike, 2008).

FFTs are a special case of simple heuristics — simple deci- sion processes that often perform remarkably well in com- parison to more complex methods (Gigerenzer, Todd, & the ABC research group, 1999; Gigerenzer, Hertwig, & Pachur, 2011) — and have been linked with the theoretical framework for diagnostic classification decisions provided bysignal de- tection theory(SDT, Luan, Schooler, & Gigerenzer, 2011).

Figure 1 illustrates an example of a FFT that predicts whether an antibiotic prescription is indicated for some pa- tients, particularly children. By checking only one or two cues physicians can identify patients at risk of being infected with a specific type of bacteria and prescribe an appropri- ate antibiotic treatment (Fischer et al., 2002). Beyond being both effective and efficient FFTs are useful by virtue of be- ing robust (by being insensitive to perturbations due to noisy data and by providing reliable out-of-sample predictions) and communicable (e.g., they can easily be understood, learned

Fever for more than 2 days?

Child older than 3 years?

Yes

No macrolides No

No macrolides No

Prescribe macrolides

Yes

Figure 1: Example of a FFT that allows clinicians to prescribe treatment with macrolides (see Fischer et al., 2002).

and taught). FFTs have successfully been developed in a va- riety of applied domains, including medical, legal, and finan- cial decision making (see Luan et al., 2011, for examples).

Content, Structure, and Activities

This half-day tutorial builds upon the lectures and materials used in previous tutorials (e.g., at theInternational Confer- ence on Cognitive Modeling, ICCM 2012) and workshops (e.g., at theMax Planck Research School on Adapting Behav- ior in a Fundamentally Uncertain World, 2012, and theABC Summer Institute on Bounded Rationality, 2013). Through a combination of presentations and practical exercises partic- ipants will become familiar with the theoretical framework behind FFTs, contrast them with alternative classification al- gorithms, and learn to construct and evaluate FFTs for real- world data sets.

The half-day tutorial interleaves lecture-style presentations with practical exercises and will be structured as follows:

Theoretical background [45 min]: We briefly introduce the basic ideas behind the simple heuristics framework to ex- plain when and why biased minds can make successful infer- ences. This illustrates how strategies with limited informa- tion search can yield robust classification decisions relative to computationally more complex models (Katsikopoulos,

43

Erschienen in: Cooperative minds : social interaction and group dynamics; proceedings of the 35th annual meeting of the Cognitive Science Society, Berlin, Germany, July 31 - August 3, 2013 / ed. by Markus

Knauff ... - Austin, TX : Cognitive Science Society, 2013. - S. 43-44. - ISBN 978-0-9768318-9-1

Konstanzer Online-Publikations-System (KOPS) URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-277875

(2)

Schooler, & Hertwig, 2010). Theoretical notions reviewed in this part include the predictive validity of cues, speed- accuracy tradeoffs, the bias-variance dilemma, assessing clas- sification outcomes via contingency tables (hits and correct rejections vs. false alarms and misses), as well as fundamen- tal concepts of SDT (e.g., criterion shifts, biasc, the sensi- tivity indexd0, and the interpretation of ROC curves, Luan et al., 2011). The questionHow can we make effective and effi- cient classification decisions on the basis of limited and noisy data?will set the stage for the practical exercises.

Hands-on sessions [2 × 45 min]: Two practical parts will explore the consequences of specific cue and criterion choices. By using interactive software tools participants will acquire hands-on experience in constructing FFTs.

1. Spreadsheet-based FFTs: In a first practical part, par- ticipants will be guided through a series of exercises using a pre-designed MS ExcelTM sheet. To facilitate the trans- fer from theoretical notions to applicable expertise we will examine the consequences of different cue choices, bias val- ues, and criterion shifts on various measures of classification performance. After assessing a selection of minimal FFTs (with only one predictive cue) participants will re-construct a FFT that has been designed to help emergency-room doctors to rapidly decide whether to send a patient with severe chest pain to the coronary care unit (Green & Mehr, 1997). Finally, particpants will explore alternative multi-cue FFTs and eval- uate their performance on a variety of outcome measures.

2. Interactive software tool (FFT-builder): A second prac- tical session will introduce a new version ofFFT-builder — an interactive software tool that allows rapid-prototyping, ex- plorative learning and the visual inspection of outcome mea- sures in the context of FFTs (see Figure 2).FFT-builderpro- vides a range of features to create and manage environments, data sets, and corresponding FFTs. Numeric and visual anal- ysis tools allow to quantify and compare the performance of different solutions to the same data or explore and inspect the consequences of applying FFTs to different data sets.

Validity and robustness [45 min]: In a final session we will cover two topics central to the theory and practical ap- plication of FFTs: their validity and their robustness. The point here is not to merely declare FFTs to be valid and ro- bust, but rather to examine the evidence base and method- ological options for addressing these important concerns. Re- sults from cross-validation analyses and a formal quantifica- tion and methodological operationalization of robustness will supplement the conceptual discussion.

Objectives

The goal of this tutorial is to provide participants with intel- lectual and software tools to tackle real-world classification problems. Upon completing the tutorial, participants will be familiar with theoretical criteria and practical skills for designing efficient, effective, and robust classification algo- rithms. By building and evaluating a variety of FFTs in an in-

Figure 2: Screenshot of theFFT-buildersoftware tool.

teractive fashion, participants will be enabled and encouraged to apply FFTs to data sets in their own domain of expertise.

References

Fischer, J., Steiner, F., Zucol, F., Berger, C., Martignon, L., Bossart, W., Altwegg, M., & Nadal, D. (2002). Use of simple heuristics to target macrolide prescription in chil- dren with community-acquired pneumonia.Archives of Pe- diatrics & Adolescent Medicine,156(10), 1005–1008.

Gigerenzer, G., Hertwig, R., & Pachur, T. (Eds.). (2011).

Heuristics: The foundations of adaptive behavior. New York, NY: Oxford University Press.

Gigerenzer, G., Todd, P. M., & the ABC research group.

(1999). Simple heuristics that make us smart. New York, NY: Oxford University Press.

Green, L., & Mehr, D. R. (1997). What alters physicians’

decisions to admit to the coronary care unit? Journal of Family Practice,45(3), 219–226.

Katsikopoulos, K., Schooler, L. J., & Hertwig, R. (2010).

The robust beauty of ordinary information. Psychological Review,117(4), 1259–1266.

Luan, S., Schooler, L. J., & Gigerenzer, G. (2011). A signal- detection analysis of fast-and-frugal trees. Psychological Review,118(2), 316–338.

Martignon, L., Katsikopoulos, K. V., & Woike, J. K. (2008).

Categorization with limited resources: A family of sim- ple heuristics.Journal of Mathematical Psychology,52(6), 352–361.

Martignon, L., Vitouch, O., Takezawa, M., & Forster, M. R.

(2003). Naïve and yet enlightened: From natural frequen- cies to fast and frugal decision trees. In D. Hardman &

L. Macchi (Eds.),Thinking: Psychological perspectives on reasoning, judgment and decision making(pp. 189–211).

Chichester, England: Wiley.

44

Referenzen

ÄHNLICHE DOKUMENTE

Inferences (with a finite set of premises; from now on we tacitly assume that premise sets are finite) can always be tranformed into tautologies using the deduction theorem..

Examples for specific application of the real-time technologies are: 5G communications, automated driving, road traffic management, 10 Gb/s real-time Ethernet in vehicles,

confidence in their market expectations (according to the risk coefficient discount factor). Therefore, the factor will be greater than or equal to 1. If the risk coefficient

Überbestellungen müssen wir leider für Sushi und Salate mit 1,00 € pro Stück und für warme Speisen mit 2,00 € pro

For the random binary search tree with n nodes inserted the number of ancestors of the elements with ranks k and `, 1 ≤ k < ` ≤ n, as well as the path distance between these

Der Fast and Frugal Tree-Fragebogen für Mobbing (FFTM) von Kolodej (2016) wurde aus vier von der Definition Leymanns (1996) abgeleiteten Fragen konstruiert.. Dieses Instrument soll

They find that Chinese adult children will be significantly less likely to migrate when their parents are in poor health and provide evidence that this effect will be less

This paper has a three-fold objective: (a) It seeks to establish the theoretical antecedents of frugal innovation by examining the scholarly discourse; (b) It attempts to