Computing optimal hypotheses efficiently for boosting

DOI10.1007/3-540-45884-0_35MaRDI QIDQ3044543zbMATH OpenFDO

Authors Shinichi Morishita

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2281/22810471.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Maximizing the margin with boosting
• Efficient margin maximizing with boosting
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Improved boosting algorithms using confidence-rated predictions
• Quadratic boosting

Cited in

(4)

• gBoost: a mathematical programming approach to graph classification and regression
• Highlighting hard patterns via AdaBoost weights evolution
• Boosting algorithms for parallel and distributed learning
• Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms

This page was built for publication: Computing optimal hypotheses efficiently for boosting

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