A noise-detection based AdaBoost algorithm for mislabeled data

Jingjing Cao

doi:10.1016/j.patcog.2012.05.002

2012-12-01

108

PRE

Jingjing Cao

Sam Kwong *

王冉 (Ran Wang)

DOI：10.1016/j.patcog.2012.05.002

原文链接

原文求助

摘要

En 中文

Noise sensitivity is known as a key related issue of AdaBoost algorithm. Previous works exhibit that AdaBoost is prone to be overfitting in dealing with the noisy data sets due to its consistent high weights assignment on hard-to-learn instances (mislabeled instances or outliers). In this paper, a new boosting approach, named noise-detection based AdaBoost (ND-AdaBoost), is exploited to combine classifiers by emphasizing on training misclassified noisy instances and correctly classified non-noisy instances. Specifically, the algorithm is designed by integrating a noise-detection based loss function into AdaBoost to adjust the weight distribution at each iteration. A k-nearest-neighbor (k-NN) and an expectation maximization (EM) based evaluation criteria are both constructed to detect noisy instances. Further, a regeneration condition is presented and analyzed to control the ensemble training error bound of the proposed algorithm which provides theoretical support. Finally, we conduct some experiments on selected binary UCI benchmark data sets and demonstrate that: the proposed algorithm is more robust than standard and other types of AdaBoost for noisy data sets. (C) 2012 Elsevier Ltd. All rights reserved.

Keyword:

Pattern recognition

Ensemble learning

AdaBoost

k-NN