|
|
|
|
| LEADER |
05485nam a22005535i 4500 |
| 001 |
978-0-387-68812-1 |
| 003 |
DE-He213 |
| 005 |
20210616050752.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 xxu| s |||| 0|eng d |
| 020 |
|
|
|a 9780387688121
|9 978-0-387-68812-1
|
| 024 |
7 |
|
|a 10.1007/978-0-387-68812-1
|2 doi
|
| 050 |
|
4 |
|a QA273.A1-274.9
|
| 050 |
|
4 |
|a QA274-274.9
|
| 072 |
|
7 |
|a PBT
|2 bicssc
|
| 072 |
|
7 |
|a MAT029000
|2 bisacsh
|
| 072 |
|
7 |
|a PBT
|2 thema
|
| 072 |
|
7 |
|a PBWL
|2 thema
|
| 082 |
0 |
4 |
|a 519.2
|2 23
|
| 100 |
1 |
|
|a Rissanen, Jorma.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 245 |
1 |
0 |
|a Information and Complexity in Statistical Modeling
|h [electronic resource] /
|c by Jorma Rissanen.
|
| 250 |
|
|
|a 1st ed. 2007.
|
| 264 |
|
1 |
|a New York, NY :
|b Springer New York :
|b Imprint: Springer,
|c 2007.
|
| 300 |
|
|
|a VIII, 142 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Information Science and Statistics,
|x 1613-9011
|
| 505 |
0 |
|
|a Information and Coding -- Shannon-Wiener Information -- Coding of Random Processes -- Statistical Modeling -- Kolmogorov Complexity -- Stochastic Complexity -- Structure Function -- Optimally Distinguishable Models -- The MDL Principle -- Applications.
|
| 520 |
|
|
|a No statistical model is "true" or "false," "right" or "wrong"; the models just have varying performance, which can be assessed. The main theme in this book is to teach modeling based on the principle that the objective is to extract the information from data that can be learned with suggested classes of probability models. The intuitive and fundamental concepts of complexity, learnable information, and noise are formalized, which provides a firm information theoretic foundation for statistical modeling. Inspired by Kolmogorov's structure function in the algorithmic theory of complexity, this is accomplished by finding the shortest code length, called the stochastic complexity, with which the data can be encoded when advantage is taken of the models in a suggested class, which amounts to the MDL (Minimum Description Length) principle. The complexity, in turn, breaks up into the shortest code length for the optimal model in a set of models that can be optimally distinguished from the given data and the rest, which defines "noise" as the incompressible part in the data without useful information. Such a view of the modeling problem permits a unified treatment of any type of parameters, their number, and even their structure. Since only optimally distinguished models are worthy of testing, we get a logically sound and straightforward treatment of hypothesis testing, in which for the first time the confidence in the test result can be assessed. Although the prerequisites include only basic probability calculus and statistics, a moderate level of mathematical proficiency would be beneficial. The different and logically unassailable view of statistical modelling should provide excellent grounds for further research and suggest topics for graduate students in all fields of modern engineering, including and not restricted to signal and image processing, bioinformatics, pattern recognition, and machine learning to mention just a few. The author is an Honorary Doctor and Professor Emeritus of the Technical University of Tampere, Finland, a Fellow of Helsinki Institute for Information Technology, and visiting Professor in the Computer Learning Research Center of University of London, Holloway, England. He is also a Foreign Member of Finland's Academy of Science and Letters, an Associate Editor of IMA Journal of Mathematical Control and Information and of EURASIP Journal on Bioinformatics and Systems Biology. He is also a former Associate Editor of Source Coding of IEEE Transactions on Information Theory. The author is the recipient of the IEEE Information Theory Society's 1993 Richard W. Hamming medal for fundamental contributions to information theory, statistical inference, control theory, and the theory of complexity; the Information Theory Society's Golden Jubilee Award in 1998 for Technological Innovation for inventing Arithmetic Coding; and the 2006 Kolmogorov medal by University of London. He has also received an IBM Corporate Award for the MDL and PMDL Principles in 1991, and two best paper awards.
|
| 650 |
|
0 |
|a Probabilities.
|
| 650 |
|
0 |
|a Coding theory.
|
| 650 |
|
0 |
|a Information theory.
|
| 650 |
|
0 |
|a Statistics .
|
| 650 |
1 |
4 |
|a Probability Theory and Stochastic Processes.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/M27004
|
| 650 |
2 |
4 |
|a Coding and Information Theory.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/I15041
|
| 650 |
2 |
4 |
|a Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences.
|0 https://scigraph.springernature.com/ontologies/product-market-codes/S17020
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9781441922670
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9780387515175
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9780387366104
|
| 830 |
|
0 |
|a Information Science and Statistics,
|x 1613-9011
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-0-387-68812-1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
