Laplace's law of succession and universal encoding

Authors:
R. E. Krichevskiy
Affiliations:
Coll. of Eng., California Univ., Riverside, CA
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 7

On asymptotically optimal methods of prediction and adaptive coding for Markov sources

Journal of Complexity
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution

ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Bernstein polynomials and learning theory

Journal of Approximation Theory
A k-norm pruning algorithm for decision tree classifiers based on error rate estimation

Machine Learning
k-norm misclassification rate estimation for decision trees

ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing
PAC-Bayesian Analysis of Co-clustering and Beyond

The Journal of Machine Learning Research
Coding of non-stationary sources as a foundation for detecting change points and outliers in binary time-series

AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134

Quantified Score

Hi-index	754.84

Visualization

Abstract

This correspondence shows that the known “add-half” rule is not asymptotically optimal for predicting the (n+1)st symbol after a sequence of n symbols, whereas the “add-β0” rule, β0=0.50922···is