The boosting: A new idea of building models

被引:104
作者
Cao, Dong-Sheng [1 ]
Xu, Qing-Song [2 ]
Liang, Yi-Zeng [1 ]
Zhang, Liang-Xiao [1 ]
Li, Hong-Dong [1 ]
机构
[1] Cent S Univ, Res Ctr Modernizat Tradit Chinese Med, Changsha 410083, Peoples R China
[2] Cent S Univ, Sch Math Sci & Comp Technol, Changsha 410083, Peoples R China
关键词
AdaBoost; Gradient boosting (GB); Classification and Regression Tree (CART); Bagging; Ensemble learning; CLASSIFICATION; REGRESSION; SELECTION; PREDICTION; ALGORITHM; COMBINATION; ENSEMBLES; FEATURES; SPLINES; TREES;
D O I
10.1016/j.chemolab.2009.09.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The idea of boosting deeply roots in our daily life practice, which constructs the general aspects of how to think about chemical problems and how to build chemical models. In mathematics, boosting is an iterative reweighting procedure by sequentially applying a base learner to reweighted versions of the training data whose current weights are modified based on how accurately the previous learners predict these samples. By using different loss criteria, boosting copes with not only classification problems but also regression problems. In this paper, the basic idea and algorithms of commonly used boosting are discussed in detail. The applications to two datasets are conducted to illustrate the significant performance of boosting. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 11
页数:11
相关论文
共 69 条
[1]   Boosting selection of speech related features to improve performance of multi-class SVMs in emotion detection [J].
Altun, Halis ;
Polat, Goekhan .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (04) :8197-8203
[2]  
[Anonymous], 2006, Pattern recognition and machine learning
[3]   A new boosting algorithm for improved time-series forecasting with recurrent neural networks [J].
Assaad, Mohammad ;
Bone, Romuald ;
Cardot, Hubert .
INFORMATION FUSION, 2008, 9 (01) :41-55
[4]   An empirical comparison of voting classification algorithms: Bagging, boosting, and variants [J].
Bauer, E ;
Kohavi, R .
MACHINE LEARNING, 1999, 36 (1-2) :105-139
[5]   Boosting for high-dimensional time-to-event data with competing risks [J].
Binder, Harald ;
Allignol, Arthur ;
Schumacher, Martin ;
Beyersmann, Jan .
BIOINFORMATICS, 2009, 25 (07) :890-896
[6]   SmcHD1, containing a structural-maintenance-of-chromosomes hinge domain, has a critical role in X inactivation [J].
Blewitt, Marnie E. ;
Gendrel, Anne-Valerie ;
Pang, Zhenyi ;
Sparrow, Duncan B. ;
Whitelaw, Nadia ;
Craig, Jeffrey M. ;
Apedaile, Anwyn ;
Hilton, Douglas J. ;
Dunwoodie, Sally L. ;
Brockdorff, Neil ;
Kay, Graham F. ;
Whitelaw, Emma .
NATURE GENETICS, 2008, 40 (05) :663-669
[7]   Improving nonparametric regression methods by bagging and boosting [J].
Borra, S ;
Di Ciaccio, A .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2002, 38 (04) :407-420
[9]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[10]   Prediction games and arcing algorithms [J].
Breiman, L .
NEURAL COMPUTATION, 1999, 11 (07) :1493-1517