|
|
|
|
LEADER |
00000cam a2200000 a 4500 |
001 |
EBSCO_ocm52854741 |
003 |
OCoLC |
005 |
20231017213018.0 |
006 |
m o d |
007 |
cr cn||||||||| |
008 |
030815t19891989si a ob 001 0 eng d |
040 |
|
|
|a N$T
|b eng
|e pn
|c N$T
|d OCLCQ
|d YDXCP
|d OCLCQ
|d MERUC
|d OCLCQ
|d E7B
|d OCLCF
|d OCLCO
|d NLGGC
|d OCLCQ
|d VTS
|d AGLDB
|d STF
|d M8D
|d UKAHL
|d LEAUB
|d CUS
|d OCLCO
|d OCLCQ
|
019 |
|
|
|a 1086430790
|
020 |
|
|
|a 9812385495
|q (electronic bk.)
|
020 |
|
|
|a 9789812385499
|q (electronic bk.)
|
020 |
|
|
|z 9789971508593
|
020 |
|
|
|z 9971508591
|
029 |
1 |
|
|a AU@
|b 000051414193
|
029 |
1 |
|
|a DEBBG
|b BV043140148
|
029 |
1 |
|
|a DEBSZ
|b 422411051
|
029 |
1 |
|
|a GBVCP
|b 801056217
|
035 |
|
|
|a (OCoLC)52854741
|z (OCoLC)1086430790
|
050 |
|
4 |
|a QA267
|b .R57 1989eb
|
072 |
|
7 |
|a MAT
|x 016000
|2 bisacsh
|
072 |
|
7 |
|a MAT
|x 018000
|2 bisacsh
|
082 |
0 |
4 |
|a 511.3
|2 20
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Rissanen, Jorma,
|e author.
|
245 |
1 |
0 |
|a Stochastic complexity in statistical inquiry /
|c Jorma Rissanen.
|
264 |
|
1 |
|a Singapore ;
|a River Edge, NJ :
|b World Scientific,
|c 1989.
|
264 |
|
4 |
|c ©1989
|
300 |
|
|
|a 1 online resource (x, 177 pages) :
|b illustrations
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a World Scientific series in computer science ;
|v v. 15
|
504 |
|
|
|a Includes bibliographical references (pages 168-175) and index.
|
588 |
0 |
|
|a Print version record.
|
505 |
0 |
|
|a 1 INTRODUCTION; 2 MODELS, CODES, AND COMPLEXITY; 3 STOCHASTIC COMPLEXITY; 4 MODEL VALIDATION; 5 LINEAR REGRESSION; 6 TIME SERIES; 7 APPLICATIONS.
|
520 |
|
|
|a 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.
|
590 |
|
|
|a eBooks on EBSCOhost
|b EBSCO eBook Subscription Academic Collection - Worldwide
|
650 |
|
0 |
|a Machine theory.
|
650 |
|
0 |
|a Computational complexity.
|
650 |
|
0 |
|a Stochastic processes.
|
650 |
|
6 |
|a Théorie des automates.
|
650 |
|
6 |
|a Complexité de calcul (Informatique)
|
650 |
|
6 |
|a Processus stochastiques.
|
650 |
|
7 |
|a MATHEMATICS
|x Infinity.
|2 bisacsh
|
650 |
|
7 |
|a MATHEMATICS
|x Logic.
|2 bisacsh
|
650 |
|
7 |
|a Computational complexity.
|2 fast
|0 (OCoLC)fst00871991
|
650 |
|
7 |
|a Machine theory.
|2 fast
|0 (OCoLC)fst01004846
|
650 |
|
7 |
|a Stochastic processes.
|2 fast
|0 (OCoLC)fst01133519
|
650 |
1 |
7 |
|a Stochastische processen.
|2 gtt
|
650 |
1 |
7 |
|a Statistiek.
|2 gtt
|
650 |
1 |
7 |
|a Informatietheorie.
|0 (NL-LeOCL)07854498X
|2 gtt
|
650 |
1 |
7 |
|a Entropie (informatietheorie)
|0 (NL-LeOCL)078498058
|2 gtt
|
650 |
|
7 |
|a Automates mathématiques, Théorie des.
|2 ram
|
650 |
|
7 |
|a Complexité de calcul (Informatique)
|2 ram
|
650 |
|
7 |
|a Processus stochastiques.
|2 ram
|
776 |
0 |
8 |
|i Print version:
|a Rissanen, Jorma.
|t Stochastic complexity in statistical inquiry.
|d Singapore ; River Edge, NJ : World Scientific, ©1989
|z 9971508591
|w (DLC) 89024817
|w (OCoLC)20421794
|
830 |
|
0 |
|a Series in computer science ;
|v v. 15.
|
856 |
4 |
0 |
|u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=91504
|z Texto completo
|
938 |
|
|
|a Askews and Holts Library Services
|b ASKH
|n AH21190227
|
938 |
|
|
|a EBSCOhost
|b EBSC
|n 91504
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 2407620
|
994 |
|
|
|a 92
|b IZTAP
|