The flexibility of models of recognition memory: an analysis by the minimum-description length principle
From MaRDI portal
Publication:654392
DOI10.1016/j.jmp.2011.09.002zbMath1229.91281MaRDI QIDQ654392
Karl Christoph Klauer, David Kellen
Publication date: 28 December 2011
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmp.2011.09.002
minimum description length; normalized maximum likelihood; recognition memory; signal detection theory; Fisher information approximation
94A13: Detection theory in information and communication theory
91E10: Cognitive psychology
62P15: Applications of statistics to psychology
Related Items
The flexibility of models of recognition memory: the case of confidence ratings, A tutorial on Fisher information, Selecting amongst multinomial models: an apologia for normalized maximum likelihood
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Evaluating models of recognition memory using first- and second-choice responses
- On the normalized maximum likelihood and Bayesian decision theory
- On the minimum description length complexity of multinomial processing tree models
- NML, Bayes and true distributions: a comment on Karabatsos and Walker (2006)
- Assessing model mimicry using the parametric bootstrap.
- Bayesian model selection and model averaging
- Special issue on model selection
- Model selection by normalized maximum likelihood
- Bayes factors: Prior sensitivity and model generalizability
- Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions
- Adaptive Design Optimization: A Mutual Information-Based Approach to Model Discrimination in Cognitive Science
- Counting probability distributions: Differential geometry and model selection
- 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