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

DOI10.1016/S0304-3975(00)00138-9zbMath0973.68255MaRDI QIDQ5941373

Eiji Takimoto, Akira Maruoka, Volodya Vovk

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

pruningdecision treeaggregating algorithmexpert modelon-line prediction

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Competitive On-line Statistics ⋮ Predicting nearly as well as the best pruning of a planar decision graph.

Uses Software

• AdaBoost.MH
• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Universal forecasting algorithms
• A game of prediction with expert advice
• The weighted majority algorithm
• A decision-theoretic generalization of on-line learning and an application to boosting
• Derandomizing stochastic prediction strategies
• Exact learning Boolean functions via the monotone theory
• Weakly learning DNF and characterizing statistical query learning using Fourier analysis
• How to use expert advice
• Universal portfolios with side information

This page was built for publication: Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme