返回
Margin-based ordered aggregation for ensemble pruning
DOI:10.1016/j.patrec.2013.01.003.png)
摘要
En 中文
Ensemble methods have been successfully used as a classification scheme. The reduction of the complexity of this popular learning paradigm motivated the appearance of ensemble pruning algorithms. This paper presents a new ensemble pruning method which highly reduces the complexity of ensemble methods and performs better than complete bagging in terms of classification accuracy. More importantly, it is a very fast algorithm. It consists in ordering all base classifiers with respect to a new criterion which exploits an unsupervised ensemble margin. This method highlights the major influence of low margin instances on the performance of the pruning task and, more generally, the potential of low margin instances for the design of better ensembles. Comparison to both the naive approach of randomly pruning base classifiers and another ordering-based pruning algorithm is carried out in an extensive empirical analysis. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Ensemble learning
Ensemble pruning
Margin
Ordered aggregation
Bagging
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
Adaptive Impedance Control to Enhance Human Skill on a Haptic Interface System自适应阻抗控制以增强触觉接口系统上的人类技能
Relevance of airborne lidar and multispectral image data for urban scene classification using Random Forests基于随机森林的城市场景分类的机载激光雷达和多光谱图像数据的相关性

