Predicting nearly as well as the best pruning of a planar decision graph

This publication has 20 references indexed in Scilit:

• Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
  Theoretical Computer Science, 2001
• Efficient Learning with Virtual Threshold Gates
  Information and Computation, 1998
• How to use expert advice
  Journal of the ACM, 1997
• Exponentiated Gradient versus Gradient Descent for Linear Predictors
  Information and Computation, 1997
• Upward Planar Drawing of Single-Source Acyclic Digraphs
  SIAM Journal on Computing, 1996
• The context-tree weighting method: basic properties
  IEEE Transactions on Information Theory, 1995
• The Weighted Majority Algorithm
  Information and Computation, 1994
• Learning classification trees
  Statistics and Computing, 1992
• The Recognition of Series Parallel Digraphs
  SIAM Journal on Computing, 1982
• Maximum flow in (s,t) planar networks
  Information Processing Letters, 1981