In two-class problems, the linear combination of the outputs (scores) of an ensemble of classifiers is widely used to attain high performance. In this paper we investigate some techniques aimed at dynamically estimate the coefficients of the linear combination on a pattern per pattern basis. We will show that such a technique allows providing better performance than those of static combination techniques, whose parameters are computed beforehand. The coefficients of the linear combination are dynamically computed according to the Wilcoxon-Mann-Whitney statistic. Reported results on a multi-modal biometric dataset show that the proposed dynamic mechanism allows attaining very low error rates when high level of precision are required. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Lobrano, C., Tronci, R., Giacinto, G., & Roli, F. (2010). Dynamic linear combination of two-class classifiers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6218 LNCS, pp. 473–482). https://doi.org/10.1007/978-3-642-14980-1_46
Mendeley helps you to discover research relevant for your work.