Supervised subspace projections for constructing ensembles of classifiers

详细信息	查看全文 | 推荐本文 |

• 作者：Nicolá ; s Garc&iacute ; a-Pedrajas^a ; ^{npedrajas@uco.es} ; ; Jesú ; s Maudes-Raedo^b ; ^{jmaudes@ubu.es} ; Cé ; sar Garc&iacute ; a-Osorio^b ; ^{cgosorio@ubu.es} ; Juan J. Rodr&iacute ; guez-D&iacute ; ez^b ; ^{jjrodriguez@ubu.es}
• 关键词：Ensembles of classifiers ; Subspace methods ; Supervised projections ; Classification
• 刊名：Information Sciences
• 出版年：2012
• 期刊代码：62_00200255
• 类别：cp
• 出版时间：15 June, 2012
• 卷：193
• 期：Complete
• 页码：1-21
• 文件大小：1202 K

摘要

We present a method for constructing ensembles of classifiers using supervised projections of random subspaces. The method combines the philosophy of boosting, focusing on difficult instances, with the improved accuracy achieved by supervised projection methods to obtain very good results in terms of testing error. To achieve both accuracy and diversity, random subspaces are created at each step, and within each random subspace, a supervised projection is obtained using only the misclassified instances. The next classifier is trained using all available examples, in the space given by the supervised projections.

The method is compared with AdaBoost and other ensemble methods, showing improved performance on a set of 32 problems from the UCI Machine Learning Repository. In terms of testing error, it obtains results that are significantly better than AdaBoost and random subspace method, using a decision tree as base learner. Furthermore, the robustness of the method in the presence of class label noise is above the results obtained with AdaBoost. A study performed using 魏-error diagrams shows that the proposed method improves the results of boosting by obtaining diverse and more accurate classifiers. The decomposition of testing error into bias and variance terms shows that our method performs better than Bagging in terms of reducing the bias term of the error, and better than AdaBoost in terms of reducing the variance term of the error.