Bagging forms a committee of classifiers by bootstrap aggregation of training sets from a pool of training data. A simple alternative to bagging is to partition the data into disjoint subsets. Experiments on various datasets show that, given the same size partitions and bags, disjoint partitions result in better performance than bootstrap aggregates (bags). Many applications (e.g., protein structure prediction) involve the use of datasets that are too large to handle in the memory of a typical computer. Our results indicate that, in such applications, the simple approach of creating a committee of classifiers from disjoint partitions is preferred over the more complex approach of bagging.
['Nitesh V. Chawla', 'Thomas E. Moore', 'Kevin W. Bowyer', 'Lawrence O. Hall', 'Clayton Springer', 'W. Philip Kegelmeyer']
Bagging is a small-data-set phenomenon