On the minimum description length complexity of multinomial processing tree models
From MaRDI portal
Recommendations
- Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004)
- A context-free language for binary multinomial processing tree models
- Bayesian estimation of multinomial processing tree models with heterogeneity in participants and items
- Beta-MPT: multinomial processing tree models for addressing individual differences
- Multinomial processing tree models of factorial categorization
Cites work
- scientific article; zbMATH DE number 3444596 (Why is no real title available?)
- A Note on the Applied Use of MDL Approximations
- A context-free language for binary multinomial processing tree models
- Estimating the dimension of a model
- Fisher information and stochastic complexity
- Model selection based on minimum description length
- Model selection by normalized maximum likelihood
- Model selection for the rate problem: a comparison of significance testing, Bayesian and minimum description length statistical inference
- New multinomial models for the Chechile-Meyer task
- On the complexity of additive clustering models
- On the minimum description length complexity of multinomial processing tree models
- Representing parametric order constraints in multi-trial applications of multinomial processing tree models
- Special issue on model selection
- Strong optimality of the normalized ML models as universal codes and information in data
- The importance of complexity in model selection
- The statistical analysis of a model for storage and retrieval processes in human memory
- The statistical analysis of general processing tree models with the EM algorithm
Cited in
(11)- The flexibility of models of recognition memory: an analysis by the minimum-description length principle
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form
- Model selection by minimum description length: lower-bound sample sizes for the Fisher information approximation
- On the minimum description length complexity of multinomial processing tree models
- A context-free language for binary multinomial processing tree models
- Cognitive psychometrics: the scientific legacy of William H. Batchelder (1940--2018)
- Multinomial processing trees with response times: changing speed and accuracy by selectively influencing a vertex
- Selecting amongst multinomial models: an apologia for normalized maximum likelihood
- The flexibility of models of recognition memory: the case of confidence ratings
- Multinomial processing tree models of factorial categorization
- Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004)
This page was built for publication: On the minimum description length complexity of multinomial processing tree models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979181)
