.png){kind=icon}
Return
Margin-based ordered aggregation for ensemble pruning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2013.01.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Ensemble learning
Ensemble pruning
Margin
Ordered aggregation
Bagging
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more