Margin distribution based bagging pruning

Zongxia Xie

doi:10.1016/j.neucom.2011.12.030

2012-05-01

PRE

DOI：10.1016/j.neucom.2011.12.030

原文链接

原文求助

摘要

En 中文

Bagging is a simple and effective technique for generating an ensemble of classifiers. It is found there are a lot of redundant base classifiers in the original Bagging. We design a pruning approach to bagging for improving its generalization power. The proposed technique introduces the margin distribution based classification loss as the optimization objective and minimizes the loss on training samples, which leads to an optimal margin distribution. Meanwhile, in order to derive a sparse ensemble, l(1) regularization is introduced to control the size of ensembles. By this way, we can obtain a sparse weight vector of base classifiers. Then we rank the base classifiers with respect to their weights and combine the base classifiers with large weights. We call this technique MArgin Distribution base Bagging pruning (MAD-Bagging). Simple voting and weighted voting are tried to combine the outputs of selected base classifiers. The performance of this pruned ensemble is evaluated with several UCI benchmark tasks, where base classifiers are trained with SVM, CART, and the nearest neighbor (1NN) rule, respectively. The results show that margin distribution based CART pruned Bagging can significantly improve classification accuracies. However, SVM and INN pruned Bagging improve little compared with single classifiers. (c) 2012 Elsevier B.V. All rights reserved.

Keyword:

Classification

Bagging

Margin distribution

Sparse ensemble