Exponential inequalities for empirical unbounded context trees

Details Exponential inequalities for empirical unbounded context trees Exponential inequalities for empirical unbounded context trees

2007-10-31

arxiv.org/abs/0710.5900v3

Mathematics

Statistics Theory

13 pages

Scientific paper

In this paper we obtain non-uniform exponential upper bounds for the rate of convergence of a version of the algorithm Context, when the underlying tree is not necessarily bounded. The algorithm Context is a well-known tool to estimate the context tree of a Variable Length Markov Chain. As a consequence of the exponential bounds we obtain a strong consistency result. We generalize in this way several previous results in the field.

Affiliated with

Also associated with

No associations

Rating

Exponential inequalities for empirical unbounded context trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exponential inequalities for empirical unbounded context trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponential inequalities for empirical unbounded context trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14934