Improved boosting algorithms using confidence-rated predictions
- 24 July 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the networkIEEE Transactions on Information Theory, 1998
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Using and combining predictors that specializePublished by Association for Computing Machinery (ACM) ,1997
- On the boosting ability of top-down decision tree learning algorithmsPublished by Association for Computing Machinery (ACM) ,1996
- A generalization of Sauer's lemmaJournal of Combinatorial Theory, Series A, 1995
- Decision theoretic generalizations of the PAC model for neural net and other learning applicationsInformation and Computation, 1992
- What Size Net Gives Valid Generalization?Neural Computation, 1989