Analysis of Generalization Ability for Different AdaBoost Variants Based on Classification and Regression Trees
As a machine learning method, AdaBoost is widely applied to data classification and object detection because of its robustness and efficiency. AdaBoost constructs a global and optimal combination of weak classifiers based on a sample reweighting. It is known that this kind of combination improves th...
Main Authors: | Shuqiong Wu, Hiroshi Nagahashi |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Journal of Electrical and Computer Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/835357 |
Similar Items
-
From AdaBoost to AHCBoost
by: Wu-Chiang Chen, et al.
Published: (2009) -
Ada-WHIPS: explaining AdaBoost classification with applications in the health sciences
by: Julian Hatwell, et al.
Published: (2020-10-01) -
An Empirical Study of AdaBoosting
by: Chang-cheng Ho, et al.
Published: (2001) -
The Rate of Convergence of AdaBoost
by: Mukherjee, Indraneel, et al.
Published: (2013) -
A Study on AdaBoost Algorithm
by: Hsieh, Chih-Yu, et al.
Published: (2014)