Boosting a weak learning algorithm by majority

This publication has 5 references indexed in Scilit:

• On the necessity of Occam algorithms
  Published by Association for Computing Machinery (ACM) ,1990
• Learnability and the Vapnik-Chervonenkis dimension
  Journal of the ACM, 1989
• Crytographic limitations on learning Boolean formulae and finite automata
  Published by Association for Computing Machinery (ACM) ,1989
• The strength of weak learnability
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
  Published by Association for Computing Machinery (ACM) ,1986