Averaged boosting: A noise-robust ensemble method

DOI10.1007/3-540-36175-8_38MaRDI QIDQ4424033zbMATH OpenFDO

Authors Yongdai Kim

Publication date 9 September 2003

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/2637/26370388.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A Hybrid Approach of Boosting Against Noisy Data
• Boosting with averaged weight vectors
• Boosting with Noisy Data: Some Views from Statistical Theory
• Boosting in the presence of noise
• A robust boosting algorithm
• A stochastic approximation view of boosting
• Ensemble learning based on approximate reducts and bootstrap sampling

Cited in

(4)

• Noise peeling methods to improve boosting algorithms
• A ROBUST ENSEMBLE LEARNING USING ZERO-ONE LOSS FUNCTION
• Wrapping boosters against noise
• A robust boosting algorithm

This page was built for publication: Averaged boosting: A noise-robust ensemble method

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