MultiBoosting Algorithm: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Text replacement - ". ----" to ". ----") |
||
| (8 intermediate revisions by 2 users not shown) | |||
| Line 2: | Line 2: | ||
'''See:''' [[Ensemble Algorithm]], [[Wagging]]. | '''See:''' [[Ensemble Algorithm]], [[Wagging]]. | ||
---- | ---- | ||
---- | ---- | ||
===2000=== | == References == | ||
* [[Geoffrey I. Webb]]. (2000). | |||
=== 2000 === | |||
* [[Geoffrey I. Webb]]. ([[2000]]). “MultiBoosting: A Technique for Combining Boosting and Wagging.</i>” Machine Learning. 40(2). | |||
---- | ---- | ||
Latest revision as of 17:25, 21 September 2021
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).