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.
"synopsis" may belong to another edition of this title.
"... this book summarizes his work on a level that requires few mathematical skills ... This treatise comprises a valuable, compact and up-to-date elementary survey of a rapidly growing new field in statistics. Mathematical Reviews, 1992 "The book is a significant contribution to the literature on systems modelling. It represents currently the only comprehensive presentation of the MDL modelling methodology. This is, in my opinion, a powerful methodology, which is likely to play an increasingly important role in the modelling business in the years ahead." Int'l Journal General Systems, 1993
"About this title" may belong to another edition of this title.
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. Volume 15. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Book contains pencil markings. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:9789971508593. Seller Inventory # 5794393
Quantity: 1 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9789971508593
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 188 pages. 8.50x6.50x0.50 inches. In Stock. Seller Inventory # x-9971508591
Quantity: 2 available
Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.
Condition: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail. Seller Inventory # OTV.9971508591.VG
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Seller Inventory # 3645194246
Quantity: Over 20 available
Seller: preigu, Osnabrück, Germany
Buch. Condition: Neu. STOCHASTIC COMPLEXITY IN STATIST.(V15) | Rissanen J | Buch | WS SERIES IN COMPUTER SCI | Gebunden | Englisch | 1989 | World Scientific | EAN 9789971508593 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 135953885
Quantity: 5 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Seller Inventory # 9789971508593
Quantity: 2 available