کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
326763 | 542539 | 2014 | 6 صفحه PDF | دانلود رایگان |
• The Fisher information approximation (FIA) is a tool for model selection.
• Using FIA may result in an incorrect rank order of complexity terms.
• A lower-bound N′N′ for the sample size is proposed to avoid this error.
• The relevance of the approach is shown in three examples.
The Fisher information approximation (FIA) is an implementation of the minimum description length principle for model selection. Unlike information criteria such as AIC or BIC, it has the advantage of taking the functional form of a model into account. Unfortunately, FIA can be misleading in finite samples, resulting in an inversion of the correct rank order of complexity terms for competing models in the worst case. As a remedy, we propose a lower-bound N′N′ for the sample size that suffices to preclude such errors. We illustrate the approach using three examples from the family of multinomial processing tree models.
Journal: Journal of Mathematical Psychology - Volume 60, June 2014, Pages 29–34