Does learning a complex task have to be complex?: A study in learning decomposition

Frank J. Lee

doi:10.1006/cogp.2000.0747

Return

Does learning a complex task have to be complex?: A study in learning decomposition

2001-05-01

105

PRE

Frank J. Lee *

Anderson, JR

DOI：10.1006/cogp.2000.0747

Original

Original request for help

Save

Abstract

En 中文

Many theories of skill acquisition have had considerable success in addressing the fine details of learning in relatively simple tasks, but can they scale up to complex tasks that are more typical of human learning in the real world? Some theories argue for scalability by making the implicit assumption that complex tasks consist of many smaller Darts, which an learned according to basic learning principles. Surprisingly, there has been rather sparse empirical testing of this crucial assumption. In this article, we examine this assumption directly by decomposing the learning in the Kanfer-Ackerman Air-Traffic Controller Task (Ackerman, 1988) from the learning at the global level all the way down to the learning at the keystroke level. First, we reanalyze the data from Ackerman (1988) and show that the learning in this complex task does indeed reflect the learning of smaller parts at the keystroke level. Second, in a follow-up eye-tracking experiment, we show that a large portion of the learning at the keystroke level reflects the learning even at a lower, i.e., attentional level. (C) 2001 Academic Press.

Keywords:

SKILL ACQUISITION

POWER-LAW

INFORMATION-REDUCTION

STRATEGY

MULTIPLICATION

AUTOMATIZATION

RETENTION

CURVES

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.