Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
- 17 June 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 261 (1) , 179-209
- https://doi.org/10.1016/s0304-3975(00)00138-9
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 14 references indexed in Scilit:
- A Game of Prediction with Expert AdviceJournal of Computer and System Sciences, 1998
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- How to use expert adviceJournal of the ACM, 1997
- An efficient extension to mixture techniques for prediction and decision treesPublished by Association for Computing Machinery (ACM) ,1997
- Universal portfolios with side informationIEEE Transactions on Information Theory, 1996
- Exact Learning Boolean Functions via the Monotone TheoryInformation and Computation, 1995
- The Weighted Majority AlgorithmInformation and Computation, 1994
- Weakly learning DNF and characterizing statistical query learning using Fourier analysisPublished by Association for Computing Machinery (ACM) ,1994
- Universal forecasting algorithmsInformation and Computation, 1992
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmMachine Learning, 1988