Chargement en cours…
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...
| Cote: | Libro Electrónico |
|---|---|
| Auteur principal: | |
| Format: | Électronique eBook |
| Langue: | Inglés |
| Publié: |
Singapore ; River Edge, NJ :
World Scientific,
1989.
|
| Collection: | Series in computer science ;
v. 15. |
| Sujets: | |
| Accès en ligne: | Texto completo |
| Résumé: | 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 "true" data generating distributions are needed, but it also in one stroke leads to calculable expressions in a range of situations of practical interest and links very closely with mainstream statistical theory. The search for the smallest stochastic complexity extends the classical maximum likelih. |
|---|---|
| Description matérielle: | 1 online resource (x, 177 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 168-175) and index. |
| ISBN: | 9812385495 9789812385499 |