Pages that link to "Item:Q2348068"
From MaRDI portal
The following pages link to Parametric order constraints in multinomial processing tree models: an extension of Knapp and Batchelder (2004) (Q2348068):
Displaying 15 items.
- Adjusted priors for Bayes factors involving reparameterized order constraints (Q313086) (← links)
- A multinomial processing tree inferred from age-related memory-error probabilities: possibility of inferring more if response times were available (Q826911) (← links)
- \textsc{Tutorial}: ``With sufficient increases in X, more people will engage in the target behavior'' (Q826949) (← links)
- The flexibility of models of recognition memory: the case of confidence ratings (Q899141) (← links)
- On the minimum description length complexity of multinomial processing tree models (Q979181) (← links)
- Bounds on variances of estimators for multinomial processing tree models (Q1410780) (← links)
- RT-MPTs: process models for response-time distributions based on multinomial processing trees with applications to recognition memory (Q1645047) (← links)
- Representing parametric order constraints in multi-trial applications of multinomial processing tree models (Q1765561) (← links)
- Measuring components of the memory of order (Q1981164) (← links)
- Sequential hypothesis tests for multinomial processing tree models (Q2177490) (← links)
- Generalized processing tree models: jointly modeling discrete and continuous variables (Q2318848) (← links)
- Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference (Q2332837) (← links)
- A general approach to prior transformation (Q2332842) (← links)
- An essay on inequalities and order-restricted inference (Q2497752) (← links)
- RT-MPTs: process models for response-time distributions with diffusion-model kernels (Q6595392) (← links)
