An improved boosting algorithm and its implications on learning complexity
- 1 July 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 391-398
- https://doi.org/10.1145/130385.130429
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Equivalence of models for polynomial learnabilityInformation and Computation, 1991
- The Strength of Weak LearnabilityMachine Learning, 1990
- Crytographic limitations on learning Boolean formulae and finite automataPublished by Association for Computing Machinery (ACM) ,1989
- The weighted majority algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimensionPublished by Association for Computing Machinery (ACM) ,1986
- A Learning Algorithm for Boltzmann Machines*Cognitive Science, 1985
- A theory of the learnableCommunications of the ACM, 1984