Improved boosting algorithm and its implications on learning complexity

Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory

Volumn , Issue , 1992, Pages 391-398

  Freund, Yoav ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; ESTIMATION; LOGIC PROGRAMMING; MANY VALUED LOGICS; MATHEMATICAL MODELS;

BOOSTING BY MAJORITY ALGORITHM; CONCEPT CLASSES; LEARNING COMPLEXITY; PROBABLY APPROXIMATELY CORRECT (PAC) MODEL; WEAK LEARNERS;

LEARNING SYSTEMS;

EID: 0026977019     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/130385.130429     Document Type: Conference Paper

References (0)