Stochastic Complexity In Statistical Inquiry
Jorma Rissanen
okt. 1998 · World Scientific Series In Computer Science Bok 15 · World Scientific
E-bok
188
Sider
family_home
Kvalifisert
info
reportVurderinger og anmeldelser blir ikke kontrollert Finn ut mer
Om denne e-boken
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 likelihood technique to a new global one, in which models can be compared regardless of their numbers of parameters. The result is a natural and far reaching extension of the traditional theory of estimation, where the Fisher information is replaced by the stochastic complexity and the Cramer-Rao inequality by an extension of the Shannon-Kullback inequality. Ideas are illustrated with applications from parametric and non-parametric regression, density and spectrum estimation, time series, hypothesis testing, contingency tables, and data compression.
Vurder denne e-boken
Fortell oss hva du mener.
Hvordan lese innhold
Smarttelefoner og nettbrett
Installer Google Play Bøker-appen for Android og iPad/iPhone. Den synkroniseres automatisk med kontoen din og lar deg lese både med og uten nett – uansett hvor du er.
Datamaskiner
Du kan lytte til lydbøker du har kjøpt på Google Play, i nettleseren på datamaskinen din.
Lesebrett og andre enheter
For å lese på lesebrett som Kobo eReader må du laste ned en fil og overføre den til enheten din. Følg den detaljerte veiledningen i brukerstøtten for å overføre filene til støttede lesebrett.
