DECISION RULE IN PROBABILISTIC CATEGORIZATION - WHAT IT IS AND HOW IT IS LEARNED
DECISION RULE IN PROBABILISTIC CATEGORIZATION - WHAT IT IS AND HOW IT IS LEARNED
复制标题
DOI:
10.1037/0096-3445.106.4.427
复制
发表时间:
1977-01-01
影响因子:
4.1
通讯作者:
HEALY, AF
中科院分区:
文献类型:
--
作者:
KUBOVY, M;HEALY, AF
Employed a numerical decision task, designed as a numerical analog of signal detection, to investigate the nature of the decision rule used for probabilistic categorization. Two conditions were compared, with 12 paid volunteers participating in 6 1-hr sessions in Condition 1, and 12 participating in 3 1-hr sessions in Condition 2. In both conditions, 1 of 2 distributions of 5-digit numbers was sampled on each trial, and S was required to determine which distribution was sampled. The numbers of deviations from the best fitting static-cutoff rule were computed for each block of 50 trials. Although the deviations were significantly more numerous in Condition 1 than in Condition 2, in Condition 1 the numbers of deviations were much closer to those in Condition 2 than to the number of deviations predicted from the best available probabilistic model. Furthermore, Conditions 1 and 2 were similar with respect to other characteristics, such as effects of practice and locations of the best fitting static-cutoff point. It is concluded that (a) in a numerical decision task a dynamic-cutoff rule is a good 1st approximation to the decision rule adopted by individuals;(b) the only dynamic-cutoff models previously available in the literature—the additive-operator models—are inadequate;(c) a new dynamic-cutoff model—the ideal-learner model—is also inadequate; and (d) individuals tend to shift their cutoffs in the normatively prescribed direction after errors, but tend to shift their cutoffs randomly after correct responses.(47 ref)(PsycINFO Database Record (c) 2016 APA, all rights reserved)