| 書目名稱 | Information and Complexity in Statistical Modeling |
| 編輯 | Jorma Rissanen |
| 視頻video | http://file.papertrans.cn/466/465916/465916.mp4 |
| 概述 | The author is a distinguished scientist in information theory and statistical modeling |
| 叢書名稱 | Information Science and Statistics |
| 圖書封面 |  |
| 描述 | .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 paramet |
| 出版日期 | Book 2007 |
| 關(guān)鍵詞 | Excel; Information; Minimum Description Length; Shannon; Signal; algorithm; algorithms; bioinformatics; calc |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-0-387-68812-1 |
| isbn_softcover | 978-1-4419-2267-0 |
| isbn_ebook | 978-0-387-68812-1Series ISSN 1613-9011 Series E-ISSN 2197-4128 |
| issn_series | 1613-9011 |
| copyright | Springer-Verlag New York 2007 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-27 11:22
發(fā)表于 2025-3-21 19:21:38
