The Minimum Description Length Principle

The Minimum Description Length Principle

Author: Peter D. Grünwald

Publisher: MIT Press

Published: 2007

Total Pages: 736

ISBN-13: 0262072815

DOWNLOAD EBOOK

This introduction to the MDL Principle provides a reference accessible to graduate students and researchers in statistics, pattern classification, machine learning, and data mining, to philosophers interested in the foundations of statistics, and to researchers in other applied sciences that involve model selection.


Advances in Minimum Description Length

Advances in Minimum Description Length

Author: Peter D. Grünwald

Publisher: MIT Press

Published: 2005

Total Pages: 464

ISBN-13: 9780262072625

DOWNLOAD EBOOK

A source book for state-of-the-art MDL, including an extensive tutorial and recent theoretical advances and practical applications in fields ranging from bioinformatics to psychology.


Information and Complexity in Statistical Modeling

Information and Complexity in Statistical Modeling

Author: Jorma Rissanen

Publisher: Springer Science & Business Media

Published: 2007-12-15

Total Pages: 145

ISBN-13: 0387688129

DOWNLOAD EBOOK

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. Although the prerequisites include only basic probability calculus and statistics, a moderate level of mathematical proficiency would be beneficial.


Information Theory and Statistics

Information Theory and Statistics

Author: Imre Csiszár

Publisher: Now Publishers Inc

Published: 2004

Total Pages: 128

ISBN-13: 9781933019055

DOWNLOAD EBOOK

Information Theory and Statistics: A Tutorial is concerned with applications of information theory concepts in statistics, in the finite alphabet setting. The topics covered include large deviations, hypothesis testing, maximum likelihood estimation in exponential families, analysis of contingency tables, and iterative algorithms with an "information geometry" background. Also, an introduction is provided to the theory of universal coding, and to statistical inference via the minimum description length principle motivated by that theory. The tutorial does not assume the reader has an in-depth knowledge of Information Theory or statistics. As such, Information Theory and Statistics: A Tutorial, is an excellent introductory text to this highly-important topic in mathematics, computer science and electrical engineering. It provides both students and researchers with an invaluable resource to quickly get up to speed in the field.


Stochastic Complexity In Statistical Inquiry

Stochastic Complexity In Statistical Inquiry

Author: Jorma Rissanen

Publisher: World Scientific

Published: 1998-10-07

Total Pages: 191

ISBN-13: 9814507407

DOWNLOAD EBOOK

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.


Advances in Intelligent Data Analysis XVIII

Advances in Intelligent Data Analysis XVIII

Author: Michael R. Berthold

Publisher: Springer

Published: 2020-04-02

Total Pages: 588

ISBN-13: 9783030445836

DOWNLOAD EBOOK

This open access book constitutes the proceedings of the 18th International Conference on Intelligent Data Analysis, IDA 2020, held in Konstanz, Germany, in April 2020. The 45 full papers presented in this volume were carefully reviewed and selected from 114 submissions. Advancing Intelligent Data Analysis requires novel, potentially game-changing ideas. IDA’s mission is to promote ideas over performance: a solid motivation can be as convincing as exhaustive empirical evaluation.


Understanding Machine Learning

Understanding Machine Learning

Author: Shai Shalev-Shwartz

Publisher: Cambridge University Press

Published: 2014-05-19

Total Pages: 415

ISBN-13: 1107057132

DOWNLOAD EBOOK

Introduces machine learning and its algorithmic paradigms, explaining the principles behind automated learning approaches and the considerations underlying their usage.


Principles of Data Mining

Principles of Data Mining

Author: David J. Hand

Publisher: MIT Press

Published: 2001-08-17

Total Pages: 594

ISBN-13: 9780262082907

DOWNLOAD EBOOK

The first truly interdisciplinary text on data mining, blending the contributions of information science, computer science, and statistics. The growing interest in data mining is motivated by a common problem across disciplines: how does one store, access, model, and ultimately describe and understand very large data sets? Historically, different aspects of data mining have been addressed independently by different disciplines. This is the first truly interdisciplinary text on data mining, blending the contributions of information science, computer science, and statistics. The book consists of three sections. The first, foundations, provides a tutorial overview of the principles underlying data mining algorithms and their application. The presentation emphasizes intuition rather than rigor. The second section, data mining algorithms, shows how algorithms are constructed to solve specific problems in a principled manner. The algorithms covered include trees and rules for classification and regression, association rules, belief networks, classical statistical models, nonlinear models such as neural networks, and local "memory-based" models. The third section shows how all of the preceding analysis fits together when applied to real-world data mining problems. Topics include the role of metadata, how to handle missing data, and data preprocessing.


Optimal Estimation of Parameters

Optimal Estimation of Parameters

Author: Jorma Rissanen

Publisher: Cambridge University Press

Published: 2012-06-07

Total Pages: 171

ISBN-13: 1107004748

DOWNLOAD EBOOK

A comprehensive and consistent theory of estimation, including a description of a powerful new tool, the generalized maximum capacity estimator.


The Nature of Statistical Learning Theory

The Nature of Statistical Learning Theory

Author: Vladimir Vapnik

Publisher: Springer Science & Business Media

Published: 2013-06-29

Total Pages: 324

ISBN-13: 1475732643

DOWNLOAD EBOOK

The aim of this book is to discuss the fundamental ideas which lie behind the statistical theory of learning and generalization. It considers learning as a general problem of function estimation based on empirical data. Omitting proofs and technical details, the author concentrates on discussing the main results of learning theory and their connections to fundamental problems in statistics. This second edition contains three new chapters devoted to further development of the learning theory and SVM techniques. Written in a readable and concise style, the book is intended for statisticians, mathematicians, physicists, and computer scientists.