Highlighting hard patterns via AdaBoost weights evolution

DOI10.1007/3-540-45428-4_7MaRDI QIDQ3046289zbMATH OpenFDO

Authors Cesare Furlanello, Stefano Merler, B. Caprile

Publication date 12 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/2364/23640072.htm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• Parallelizing AdaBoost by weights dynamics
• Adaptive sampling for large scale boosting
• Weighted bagging: a modification of AdaBoost from the perspective of importance sampling
• Improvement of boosting algorithm by modifying the weighting rule
• Computing optimal hypotheses efficiently for boosting

Cited in

(3)

• Parallelizing AdaBoost by weights dynamics
• The beneficial effects of using multi-net systems that focus on hard patterns
• Weighted bagging: a modification of AdaBoost from the perspective of importance sampling

This page was built for publication: Highlighting hard patterns via AdaBoost weights evolution

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