arrow
返回

Minimum description length model selection of multinomial processing tree models

delete2010-06-01
delete30
delete
OA
AI
H
Hao Wu *
J
Jay I. Myung
W
William H. Batchelder
DOI:10.3758/PBR.17.3.275delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Multinomial processing tree (MPT) modeling has been widely and successfully applied as a statistical methodology for measuring hypothesized latent cognitive processes in selected experimental paradigms. In this article, we address the problem of selecting the best MPT model from a set of scientifically plausible MPT models, given observed data. We introduce a minimum description length (MDL) based model-selection approach that overcomes the limitations of existing methods such as the G(2)-based likelihood ratio test, the Akaike information criterion, and the Bayesian information criterion. To help ease the computational burden of implementing MDL, we provide a computer program in MATLAB that performs MDL-based model selection for any MPT model, with or without inequality constraints. Finally, we discuss applications of the MDL approach to well-studied MPT models with real data sets collected in two different experimental paradigms: source monitoring and pair clustering. The aforementioned MATLAB program may be downloaded from http://pbr.psychonomic-journals.org/content/supplemental.
Keyword:
BAYESIAN INFORMATION CRITERION
STATISTICAL-ANALYSIS
SPECIAL-ISSUE
COMPLEXITY
STORAGE
CRITIQUE
MEMORY
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

P
Psychonomic Bulletin and Review
IF:
3
论文数:
4.5K
被引数:
1.5W

机构

U
University System of Ohio
学者数:
15.4W
论文数: 13.0W
被引数: 200
O
Ohio State University
学者数:
4.1W
论文数: 3.2W
被引数: 80
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容