Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004)
From MaRDI portal
Publication:2348068
Abstract: Multinomial processing tree (MPT) models are tools for disentangling the contributions of latent cognitive processes in a given experimental paradigm. The present note analyzes MPT models subject to order constraints on subsets of its parameters. The constraints that we consider frequently arise in cases where the response categories are ordered in some sense such as in confidence-rating data, Likert scale data, where graded guessing tendencies or response biases are created via base-rate or payoff manipulations, in the analysis of contingency tables with order constraints, and in many other cases. We show how to construct an MPT model without order constraints that is statistically equivalent to the MPT model with order constraints. This new closure result extends the mathematical analysis of the MPT class, and it offers an approach to order-restricted inference that extends the approaches discussed by Knapp and Batchelder (2004). The usefulness of the method is illustrated by means of an analysis of an order-constrained version of the two-high-threshold model for confidence ratings.
Recommendations
- Representing parametric order constraints in multi-trial applications of multinomial processing tree models
- A multinomial processing tree inferred from age-related memory-error probabilities: possibility of inferring more if response times were available
- Beta-MPT: multinomial processing tree models for addressing individual differences
- RT-MPTs: process models for response-time distributions based on multinomial processing trees with applications to recognition memory
- Bayesian estimation of multinomial processing tree models with heterogeneity in participants and items
Cites work
- A context-free language for binary multinomial processing tree models
- Beta-MPT: multinomial processing tree models for addressing individual differences
- Bounds on variances of estimators for multinomial processing tree models
- Hierarchical multinomial processing tree models: a latent-class approach
- Hierarchical multinomial processing tree models: a latent-trait approach
- scientific article; zbMATH DE number 193111 (Why is no real title available?)
- scientific article; zbMATH DE number 3271181 (Why is no real title available?)
- 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
- 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
Cited in
(15)- Bounds on variances of estimators for multinomial processing tree models
- RT-MPTs: process models for response-time distributions based on multinomial processing trees with applications to recognition memory
- Representing parametric order constraints in multi-trial applications of multinomial processing tree models
- Measuring components of the memory of order
- Sequential hypothesis tests for multinomial processing tree models
- Generalized processing tree models: jointly modeling discrete and continuous variables
- Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference
- A general approach to prior transformation
- An essay on inequalities and order-restricted inference
- Adjusted priors for Bayes factors involving reparameterized order constraints
- RT-MPTs: process models for response-time distributions with diffusion-model kernels
- A multinomial processing tree inferred from age-related memory-error probabilities: possibility of inferring more if response times were available
- \textsc{Tutorial}: ``With sufficient increases in X, more people will engage in the target behavior
- The flexibility of models of recognition memory: the case of confidence ratings
- On the minimum description length complexity of 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)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348068)
