Acquisition of Children's Addition Strategies: A Model of Impasse-Free, Knowledge-Level Learning
dc.contributor.author | Jones, Randolph M. | en_US |
dc.contributor.author | Lehn, Kurt | en_US |
dc.date.accessioned | 2006-09-11T18:20:33Z | |
dc.date.available | 2006-09-11T18:20:33Z | |
dc.date.issued | 1994-07 | en_US |
dc.identifier.citation | Jones, Randolph M.; Lehn, Kurt; (1994). "Acquisition of Children's Addition Strategies: A Model of Impasse-Free, Knowledge-Level Learning." Machine Learning 16 (1-2): 11-36. <http://hdl.handle.net/2027.42/46902> | en_US |
dc.identifier.issn | 0885-6125 | en_US |
dc.identifier.issn | 1573-0565 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/46902 | |
dc.description.abstract | When children learn to add, they count on their fingers, beginning with the simple SUM strategy and gradually developing the more sophisticated and efficient MIN strategy. The shift from SUM to MIN provides an ideal domain for the study of naturally occurring discovery processes in cognitive skill acquisition. The SUM-to-MIN transition poses a number of challenges for machine-learning systems that would model the phenomenon. First, in addition to the SUM and MIN strategies, Siegler and Jenkins (1989) found that children exhibit two transitional strategies, but not a strategy proposed by an earlier model. Second, they found that children do not invent the MIN strategy in response to impasses, or gaps in their knowledge. Rather, MIN develops spontaneously and gradually replaces earlier strategies. Third, intricate structural differences between the SUM and MIN strategies make it difficult, if not impossible, for standard, symbol-level machine-learning algorithms to model the transition. We present a computer model, called GIPS, that meets these challenges. GIPS combines a relatively simple algorithm for problem solving with a probabilistic learning algorithm that performs symbol-level and knowledge-level learning, both in the presence and absence of impasses. In addition, GIPS makes psychologically plausible demands on local processing and memory. Most importantly, the system successfully models the shift from SUM to MIN, as well as the two transitional strategies found by Siegler and Jenkins. | en_US |
dc.format.extent | 1866651 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers-Plenum Publishers; Kluwer Academic Publishers ; Springer Science+Business Media | en_US |
dc.subject.other | Computer Science | en_US |
dc.subject.other | Computer Science, General | en_US |
dc.subject.other | Artificial Intelligence (Incl. Robotics) | en_US |
dc.subject.other | Automation and Robotics | en_US |
dc.subject.other | Cognitive Simulation | en_US |
dc.subject.other | Impasse-free Learning | en_US |
dc.subject.other | Probabilistic Learning | en_US |
dc.subject.other | Induction | en_US |
dc.subject.other | Problem-solving Strategies | en_US |
dc.title | Acquisition of Children's Addition Strategies: A Model of Impasse-Free, Knowledge-Level Learning | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Science (General) | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Artificial Intelligence Laboratory, University of Michigan, 1101 Beal Avenue, Ann Arbor, MI, 48109-2110 | en_US |
dc.contributor.affiliationother | Learning Research and Development Center, Department of Computer Science, University of Pittsburgh, Pittsburgh, PA, 15260 | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/46902/1/10994_2004_Article_422598.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1023/A:1022626701243 | en_US |
dc.identifier.source | Machine Learning | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.