Learning Theory

DOI10.1007/B98522zbMATH Open1078.68724OpenAlexW4206057230MaRDI QIDQ4680902FDOQ4680902

Authors: Cynthia Rudin, Robert E. Schapire, Ingrid Daubechies 

Publication date: 13 June 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98522

Recommendations

• Analysis of boosting algorithms using the smooth margin function
• scientific article; zbMATH DE number 2089372
• scientific article; zbMATH DE number 5251641
• Efficient margin maximizing with boosting
• Boosting as a regularized path to a maximum margin classifier

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (10)

• Boosting as a regularized path to a maximum margin classifier
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Further results on the margin explanation of boosting: new algorithm and experiments
• Smooth Boosting Using an Information-Based Criterion
• Smooth Boosting for Margin-Based Ranking
• Learning Theory
• Efficient margin maximizing with boosting
• Analysis of boosting algorithms using the smooth margin function

This page was built for publication: Learning Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680902)