Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004)

DOI10.1016/j.jmp.2014.11.001zbMath1318.62102arXiv1411.2571OpenAlexW2039588853WikidataQ59385666 ScholiaQ59385666MaRDI QIDQ2348068

Henrik Singmann, David Kellen, Karl Christoph Klauer

Publication date: 10 June 2015

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

Full work available at URL: https://arxiv.org/abs/1411.2571

zbMATH Keywords

multinomial distributionmathematical modelscategorical datamultinomial processing tree models

Mathematics Subject Classification ID

Parametric inference under constraints (62F30) Memory and learning in psychology (91E40) Applications of statistics to psychology (62P15)

Related Items (5)

Adjusted priors for Bayes factors involving reparameterized order constraints ⋮ RT-MPTs: process models for response-time distributions based on multinomial processing trees with applications to recognition memory ⋮ The flexibility of models of recognition memory: the case of confidence ratings ⋮ Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference ⋮ A general approach to prior transformation

Uses Software

• HMMTree
• MPTinR
• Multitree

Cites Work

• Unnamed Item
• Unnamed Item
• Hierarchical multinomial processing tree models: a latent-trait approach
• Beta-MPT: multinomial processing tree models for addressing individual differences
• On the minimum description length complexity of multinomial processing tree models
• Bounds on variances of estimators for multinomial processing tree models
• Representing parametric order constraints in multi-trial applications of multinomial processing tree models
• The analysis of contingency tables under inequality constraints
• The statistical analysis of general processing tree models with the EM algorithm
• Hierarchical multinomial processing tree models: a latent-class approach
• Model selection by minimum description length: lower-bound sample sizes for the Fisher information approximation
• A context-free language for binary multinomial processing tree models

This page was built for publication: Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004)