On the minimum description length complexity of multinomial processing tree models (Q979181)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the minimum description length complexity of multinomial processing tree models |
scientific article; zbMATH DE number 5726688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum description length complexity of multinomial processing tree models |
scientific article; zbMATH DE number 5726688 |
Statements
On the minimum description length complexity of multinomial processing tree models (English)
0 references
25 June 2010
0 references
model complexity
0 references
multinomial processing tree models
0 references
minimum description length
0 references
0 references
0 references
0 references
0.7680954337120056
0 references
0.7665110230445862
0 references
0.7606986165046692
0 references
0.759911060333252
0 references
0.7598932385444641
0 references
