Our hypothesis: ensembles are well suited for problems with distribution changes.
If those changes are characterizable, ensembles can be designed to tackle them.
Idea: to generate different samples based on the expected distribution changes.
Case study: we present ensembles versions of two binary quantification algorithms.
Ensembles outperform original counterpart algorithms using trivial aggregation rules.