Stochastic complexity in statistical inquiry /
This book describes how model selection and statistical inference can be founded on the shortest code length for the observed data, called the stochastic complexity. This generalization of the algorithmic complexity not only offers an objective view of statistics, where no prejudiced assumptions of...
Call Number: | Libro Electrónico |
---|---|
Main Author: | Rissanen, Jorma (Author) |
Format: | Electronic eBook |
Language: | Inglés |
Published: |
Singapore ; River Edge, NJ :
World Scientific,
1989.
|
Series: | Series in computer science ;
v. 15. |
Subjects: | |
Online Access: | Texto completo |
Similar Items
-
Randomness and complexity : from Leibniz to Chaitin /
Published: (2007) -
Randomness and complexity : from Leibniz to Chaitin /
Published: (2007) -
Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 /
Published: (2001) -
Randomness through computation : some answers, more questions /
Published: (2011) -
Randomness through computation : some answers, more questions /
Published: (2011)