On the minimum description length complexity of multinomial processing tree models (Q979181): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q33874537, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4769776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistical analysis of a model for storage and retrieval processes in human memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: New multinomial models for the Chechile-Meyer task / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model selection based on minimum description length / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistical analysis of general processing tree models with the EM algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing parametric order constraints in multi-trial applications of multinomial processing tree models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of additive clustering models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model selection for the rate problem: a comparison of significance testing, Bayesian and minimum description length statistical inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: The importance of complexity in model selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue on model selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model selection by normalized maximum likelihood / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Applied Use of MDL Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A context-free language for binary multinomial processing tree models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fisher information and stochastic complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong optimality of the normalized ML models as universal codes and information in data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the dimension of a model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum description length complexity of multinomial processing tree models / rank
 
Normal rank

Latest revision as of 22:34, 2 July 2024

scientific article
Language Label Description Also known as
English
On the minimum description length complexity of multinomial processing tree models
scientific article

    Statements

    On the minimum description length complexity of multinomial processing tree models (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2010
    0 references
    model complexity
    0 references
    multinomial processing tree models
    0 references
    minimum description length
    0 references

    Identifiers