A Theory of Probabilistic Boosting, Decision Trees and Matryoshki

Details A Theory of Probabilistic Boosting, Decision Trees and Matryoshki A Theory of Probabilistic Boosting, Decision Trees and Matryoshki

2006-07-25

arxiv.org/abs/cs/0607110v1

Computer Science

Learning

Scientific paper

We present a theory of boosting probabilistic classifiers. We place ourselves in the situation of a user who only provides a stopping parameter and a probabilistic weak learner/classifier and compare three types of boosting algorithms: probabilistic Adaboost, decision tree, and tree of trees of ... of trees, which we call matryoshka. "Nested tree," "embedded tree" and "recursive tree" are also appropriate names for this algorithm, which is one of our contributions. Our other contribution is the theoretical analysis of the algorithms, in which we give training error bounds. This analysis suggests that the matryoshka leverages probabilistic weak classifiers more efficiently than simple decision trees.

Affiliated with

Also associated with

No associations

Rating

A Theory of Probabilistic Boosting, Decision Trees and Matryoshki 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 A Theory of Probabilistic Boosting, Decision Trees and Matryoshki, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Theory of Probabilistic Boosting, Decision Trees and Matryoshki will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-665155