MultiBoosting Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - "0===" to "0 ===") |
||
| Line 6: | Line 6: | ||
==References == | ==References == | ||
===2000=== | ===2000 === | ||
* [[Geoffrey I. Webb]]. (2000). "MultiBoosting: A Technique for Combining Boosting and Wagging.</i>" Machine Learning. 40(2). | * [[Geoffrey I. Webb]]. (2000). "MultiBoosting: A Technique for Combining Boosting and Wagging.</i>" Machine Learning. 40(2). | ||
Revision as of 22:26, 2 November 2017
A MultiBoosting Algorithm is an Ensemble Supervised Learning Algorithm that uses Subcommittees based on the AdaBoost Algorithm and a Committee based on a Wagging Algorithm.
See: Ensemble Algorithm, Wagging.
References
2000
- Geoffrey I. Webb. (2000). "MultiBoosting: A Technique for Combining Boosting and Wagging." Machine Learning. 40(2).