On the minimum description length complexity of multinomial processing tree models

DOI10.1016/j.jmp.2010.02.001zbMath1190.62192OpenAlexW1964075009WikidataQ33874537 ScholiaQ33874537MaRDI QIDQ979181

Hao Wu, Jay I. Myung, William H. Batchelder

Publication date: 25 June 2010

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc2875838

zbMATH Keywords

minimum description lengthmodel complexitymultinomial processing tree models

Mathematics Subject Classification ID

Related Items (9)

Cognitive psychometrics: the scientific legacy of William H. Batchelder (1940--2018) ⋮ Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form ⋮ A context-free language for binary multinomial processing tree models ⋮ The flexibility of models of recognition memory: the case of confidence ratings ⋮ Selecting amongst multinomial models: an apologia for normalized maximum likelihood ⋮ The flexibility of models of recognition memory: an analysis by the minimum-description length principle ⋮ On the minimum description length complexity of multinomial processing tree models ⋮ Model selection by minimum description length: lower-bound sample sizes for the Fisher information approximation ⋮ Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004)

Uses Software

• GPT.EXE

Cites Work

• Unnamed Item
• On the minimum description length complexity of multinomial processing tree models
• Estimating the dimension of a model
• On the complexity of additive clustering models
• Representing parametric order constraints in multi-trial applications of multinomial processing tree models
• New multinomial models for the Chechile-Meyer task
• The statistical analysis of general processing tree models with the EM algorithm
• Model selection based on minimum description length
• The importance of complexity in model selection
• Special issue on model selection
• Model selection by normalized maximum likelihood
• Model selection for the rate problem: a comparison of significance testing, Bayesian and minimum description length statistical inference
• A context-free language for binary multinomial processing tree models
• The statistical analysis of a model for storage and retrieval processes in human memory
• Strong optimality of the normalized ML models as universal codes and information in data
• A Note on the Applied Use of MDL Approximations
• Fisher information and stochastic complexity

This page was built for publication: On the minimum description length complexity of multinomial processing tree models