.png){kind=icon}
.png){kind=icon}
Return
Dynamic ensemble selection for quantification tasks
.png){kind=icon}
OA
AI
DOI：10.1016/j.inffus.2018.01.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Ensembles are among the most effective and successful methods for almost all supervised tasks. Not long ago, an ensemble approach has been proposed for quantification learning. The idea of such method is to exploit the prior knowledge about quantification tasks, building ensembles in which diversity is achieved by training each model with a different distribution. These training samples are generated taking into account the expected drift in class distribution. This paper extends this method proposing three new quantifier selection criteria particularly devised for quantification problems, where two of them are defined for dynamic ensemble selection. The experiments demonstrate that, in many cases, these selection functions outperform straightforward approaches, like averaging all models and using quantification accuracy to prune the ensemble. Moreover, the results show that performance heavily depends on the combination of the base quantification algorithm and the selection measure.
Keywords:
Quantification
Ensembles
Dynamic ensemble selection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.