Back to search
Boosting a weak learning algorithm by majority
Data up to Jan 2025
Published1990
Citations166
References6
Total Citations Per Year
Abstract
References (6)
Learnability and the Vapnik-Chervonenkis dimension
1989 • 1,855 citations
Crytographic limitations on learning Boolean formulae and finite automata
1989 • 272 citations
The strength of weak learnability
1989 • 265 citations
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
1986 • 168 citations
Learning boolean formulae or finite automata is as hard as factoring
1988 • 103 citations
On the necessity of Occam algorithms
1990 • 55 citations
Cited By (0)
Loading...