Combining binary classifiers with Imprecise probabilities

This paper proposes a simple framework to combine binary classifiers whose outputs are imprecise probabilities (or are transformed into some imprecise probabilities, e.g., by using confidence intervals). This combination comes down to solve linear programs describing constraints over events (here, subsets of classes). The number of constraints grows linearly with the number of classifiers, making the proposed framework tractable for problems involving a relatively large number of classes. After detailing the method, we provide some first experimental results illustrating the method interests.