|
227
|
Fisher information and stochastic complexity
– J Rissanen
- 1996
|
|
7
|
An empirical study of minimum description length model selection with infinite parametric complexity
– Steven de Rooij, Peter Grünwald
- 2006
|
|
892
|
Modeling by Shortest Data Description
– J Rissanen
|
|
1581
|
Estimating the dimension of a model
– G E Schwarz
- 1978
|
|
312
|
M.M.: Context theory of classification learning
– D L Medin, Schaffer
- 1978
|
|
299
|
Attention, similarity, and the identification-Categorization Relationship
– Robert M. Nosofsky
- 1986
|
|
2
|
optimality of the normalized ML models as universal codes and information in data
– “Strong
- 2001
|
|
3
|
A note on the applied use of MDL approximations
– D Navarro
- 2004
|
|
4
|
NML Computation Algorithms for Tree-Structured Multinomial Bayesian Networks
– Petri Kontkanen, Hannes Wettig, Petri Myllymäki
- 2007
|
|
3
|
Calculating the normalized maximum likelihood distribution for Bayesian forests
– Hannes Wettig, Petri Kontkanen, Petri Myllymäki
- 2007
|
|
3
|
Fast NML computation for naive Bayes models
– Tommi Mononen, Petri Myllymäki
- 2007
|
|
14
|
A lineartime algorithm for computing the multinomial stochastic complexity
– Petri Kontkanen, Petri Myllymäki
- 2007
|
|
36
|
MDL Denoising
– Jorma Rissanen, J. Rissanen
- 1999
|
|
76
|
The Minimum Description Length Principle
– P D Grünwald
- 2007
|
|
91
|
Universal sequential coding of single messages
– Y M Shtarkov
- 1987
|
|
37
|
The importance of complexity in model selection
– I J Myung
- 2000
|
|
55
|
Applying occam's razor in modeling cognition: a Bayesian approach
– I J Myung, M A Pitt
- 1997
|
|
41
|
Toward a method of selecting among computational models of cognition
– Mark A. Pitt, In Jae Myung, Shaobo Zhang
- 2002
|
|
19
|
When a good fit can be bad
– M Pitt, J Myung
- 2002
|
