Partially Corrective AdaBoost

Authors:
Yan Jiang;Xiaoqing Ding
Affiliations:
Department of Electronic Engineering, Tsinghua University, Beijing, China 100084;Department of Electronic Engineering, Tsinghua University, Beijing, China 100084
Venue:
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2008

Citing 3
Cited 0

Boosting as entropy projection

COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Measures of Diversity in Classifier Ensembles and Their Relationship with the Ensemble Accuracy

Machine Learning
A decision-theoretic generalization of on-line learning and an application to boosting

EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel algorithm to improve the ensemble performance of AdaBoost. The main contribution in our algorithm includes two aspects: (1) we aim to generate a distribution at each step that has less correlation with the previous classifiers so as to enhance the searching efficiency for new classifiers; (2) the classifiers weights can be iteratively modified along with the training process. In the proposed algorithm, the distribution is required to be corrective to some previous classifiers or some previous classifiers' linear combinations. Experiments on UCI Repository have validated the new algorithm's effectiveness.