Bagging for linear classifiers

133Citations
Citations of this article
76Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Classifiers built on small training sets are usually biased or unstable. Different techniques exist to construct more stable classifiers. It is not clear which ones are good, and whether they really stabilize the classifier or just improve the performance. In this paper bagging (bootstrapping and aggregating) [L. Breiman, Bagging predictors, Machine Learning J. 24(2), 123-140 (1996)] is studied for a number of linear classifiers. A measure for the instability of classifiers is introduced. The influence of regularization and bagging on this instability and the generalization error of linear classifiers is investigated. In a simulation study it is shown that in general bagging is not a stabilizing technique. It is also demonstrated that one can consider the instability of the classifier to predict how useful bagging will be. Finally, it is shown experimentally that bagging might improve the performance of the classifier only for very unstable situations. © 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Skurichina, M., & Duin, R. P. W. (1998). Bagging for linear classifiers. Pattern Recognition, 31(7), 909–930. https://doi.org/10.1016/S0031-3203(97)00110-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free