Boosting using branching programs

Journal of Computer and System Sciences

Volumn 64, Issue 1, 2002, Pages 103-112

  Mansour, Yishay ^a   McAllester, David ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b ATandT Research   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAM LISTINGS; DECISION THEORY; ERROR ANALYSIS; TREES (MATHEMATICS);

BRANCHING PROGRAMS;

LEARNING SYSTEMS;

EID: 0036477333     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1796     Document Type: Article

References (13)

1. 1
2. On learning branching programs and small depth circuits
3. On learning width two branching programs
4. Applying the weak learning framework to understand and improve 04.5
5. On learning bounded-width branching programs
6. Boosting a weak learning algorithm by majority
7. A decision-theoretic generalization of on-line learning and an application to boosting
8. On the boosting ability of top-clown decision tree learning algorithms
9. Boosting with multi-way branching in decision trees
10. Learning μ-branching programs with queries
11. The strength of weak learnability