Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme

Eiji Takimoto, Akira Maruoka, Volodya Vovk

Research output: Contribution to journalConference article

12 Citations (Scopus)

Abstract

Helmbold and Schapire gave an on-line prediction algorithm that, when given an unpruned decision tree, produces predictions not much worse than the predictions made by the best pruning of the given decision tree. In this paper, we give two new on-line algorithms. The first algorithm is based on the observation that finding the best pruning can be efficiently solved by a dynamic programming in the "batch" setting where all the data to be predicted are given in advance. This algorithm works well for a wide class of loss functions, whereas the one given by Helmbold and Schapire is only described for the absolute loss function. Moreover, the algorithm given in this paper is so simple and general that it could be applied to many other on-line optimization problems solved by dynamic programming. We also explore the second algorithm that is competitive not only with the best pruning but also with the best prediction values which are associated with nodes in the decision tree. In this setting, a greatly simplified algorithm is given for the absolute loss function. It can be easily generalized to the case where, instead of using decision trees, data are classified in some arbitrarily fixed manner.

Original languageEnglish
Pages (from-to)179-209
Number of pages31
JournalTheoretical Computer Science
Volume261
Issue number1
DOIs
Publication statusPublished - Aug 1 2001
Externally publishedYes
Event8th International Workshop on Algorithmic Learning Theory - Sendai, Japan
Duration: Oct 6 1997Oct 8 1997

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme'. Together they form a unique fingerprint.

Cite this