Stochastic complexity in statistical inquiry
42 min read
Rate this book:
About This Book
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.
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.
Buy This Book
As an Amazon Associate and Bookshop.org affiliate, BookOrb earns from qualifying purchases.
Write a Review
Sign in to write a review.