Abstract
Bagging and boosting have become increasingly important ensemble methods for combining models in the data mining and machine learning literature. We review the basic ideas of these methods, propose a new robust boosting algorithm based on a non-convex loss function and compare the performance of these methods to both simulated and real data sets with and without contamination.
Keywords: Bagging, Boosting, Data Mining, Machine Learning, Robust
Current Analytical Chemistry
Title:A Robust Boosting Algorithm for Chemical Modeling
Volume: 8 Issue: 2
Author(s): Ville A. Satopaa and Richard D. De Veaux
Affiliation:
Keywords: Bagging, Boosting, Data Mining, Machine Learning, Robust
Abstract: Bagging and boosting have become increasingly important ensemble methods for combining models in the data mining and machine learning literature. We review the basic ideas of these methods, propose a new robust boosting algorithm based on a non-convex loss function and compare the performance of these methods to both simulated and real data sets with and without contamination.
Export Options
About this article
Cite this article as:
A. Satopaa Ville and D. De Veaux Richard, A Robust Boosting Algorithm for Chemical Modeling, Current Analytical Chemistry 2012; 8 (2) . https://dx.doi.org/10.2174/157341112800392599
DOI https://dx.doi.org/10.2174/157341112800392599 |
Print ISSN 1573-4110 |
Publisher Name Bentham Science Publisher |
Online ISSN 1875-6727 |
- Author Guidelines
- Graphical Abstracts
- Fabricating and Stating False Information
- Research Misconduct
- Post Publication Discussions and Corrections
- Publishing Ethics and Rectitude
- Increase Visibility of Your Article
- Archiving Policies
- Peer Review Workflow
- Order Your Article Before Print
- Promote Your Article
- Manuscript Transfer Facility
- Editorial Policies
- Allegations from Whistleblowers
- Announcements