.png){kind=icon}
返回
Using ensembles for problems with characterizable changes in data distribution: A case study on quantification
.png){kind=icon}
OA
AI
DOI：10.1016/j.inffus.2016.07.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ensemble methods are widely applied to supervised learning tasks. Based on a simple strategy they often achieve good performance, especially when the single models comprising the ensemble are diverse. Diversity can be introduced into the ensemble by creating different training samples for each model. In that case, each model is trained with a data distribution that may be different from the original training set distribution. Following that idea, this paper analyzes the hypothesis that ensembles can be especially appropriate in problems that: (i) suffer from distribution changes, (ii) it is possible to characterize those changes beforehand. The idea consists in generating different training samples based on the expected distribution changes, and to train one model with each of them. As a case study, we shall focus on binary quantification problems, introducing ensembles versions for two well-known quantification algorithms. Experimental results show that these ensemble adaptations outperform the original counterpart algorithms, even when trivial aggregation rules are used. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Distribution changes
Ensembles
Quantification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
15.5
论文数:
4.2K
被引数:
2.7W
机构
引用论文
A response to Webb and Ting's On the application of ROC analysis to predict classification performance under varying class distributions.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏分享收藏
查看更多内容