.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Quantification
Ensembles
Dynamic ensemble selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
15.5
论文数:
4.2K
被引数:
2.7W
机构
引用论文
分享收藏Using ensembles for problems with characterizable changes in data distribution: A case study on quantification.png)
INFORMATION FUSIONOAAI
INFORMATION FUSIONIF15.5
OAAI分享收藏
查看更多内容