Weka[]Bagging源代码分析.docVIP

Weka[25] Bagging 源代码分析 作者：Koala++/屈伟 先翻译一段 Bagging 的介绍，Breiman 的 bagging 算法，是 bootstrap aggregating 的缩写， 是最早的 Ensemble 算法之一，它也是最直接容易实现，又有着另人惊讶的好效果的算法之 一。Bagging 中的多样性是由有放回抽取训练样本来实现的，用这种方式随机产生多个训练 数据的子集，在每一个训练集的子集上训练一个同种分类器，最终分类结果是由多个分类器 的分类结果多数投票而产生的。Breiman’s bagging, short for bootstrap aggregating, is one of the earliest ensemble based algorithms. It is also one of the most intuitive and simplest to implement, with a surprisingly good performance . Diversity in bagging is obtained by using bootstrapped replicas of the training data: different training data subsets are randomly drawn—with replacement—from the entire training data. Each training data subset is used to train a different classifier of the same type. Individual classifiers are then combined by taking a majority vote of their decisions. For any given instance, the class chosen by most classifiers is the ensemble decision. Bagging 类 在 weka.classifiers.meta 包 下 面 。 Bagging 继 承 自 RandomizeableInteratedSingleClassifierEnhancer，而它又继承自 IteratedSingleClassifierEnhancer， 它再继承自 SingleClassifierEnhancer，最后一个继承自 Classifier。我的 UML 工具似乎过期了， 有空补上。 看一下构造函数： public Bagging() { m_Classifier = new weka.classifiers.trees.REPTree(); } 可以看到默认的基分类器是 REPTree。 接下来看 buildClassifier 函数： // can classifier handle the data? getCapabilities().testWithFail(data); // remove instances with missing class data = new Instances(data); data.deleteWithMissingClass(); super.buildClassifier(data); if (m_CalcOutOfBag (m_BagSizePercent != 100)) { throw new IllegalArgumentException(Bag size needs to be 100% if + out-of-bag error is to be calculated!); } 只有一行代码值得看一下 super.buildClassifier： public void buildClassifier(Instances data) throws Exception { if (m_Classifier == null) { throw new Exception(A base classifier has not been specified!); } m_Classifiers = Classifier.makeCopies(m_Classifier, m_NumIterations); } 这里将 m_Classifier 复制 m_NumIterations 份到 m_Classifiers 数组中去。 int bagSize = data.numInstances() *