| Ruta D, Gabrys B. A theoretical analysis of the limits of majority voting errors for multiple classifier systems. Pattern Analysis and Applications (submitted). |
....= d i;j : 5) Ties are resolved arbitrarily. This rule is often called in the literature the majority vote. It will indeed coincide with the simple majority (50 of the votes 1) in the case of two classes (c = 2) Various studies are devoted to the majority vote for classi er combination [1, 2, 16, 17, 19], etc. The remaining simple combination methods require soft labels. The Minimum simple combiner operates by taking the minimum in each column thereby forming the vector D(x) 1 (x) c (x) as j (x) F (d 1;j (x) d L;j (x) j = 1; c; 6) where F stands for ....
D. Ruta and B. Gabrys. A theoretical analysis of the limits of majority voting errors for multiple classi er systems. Technical Report 11, ISSN 1461-6122, Department of Computing and Information Systems, University of Paisley, December 2000.
No context found.
Ruta D, Gabrys B. A theoretical analysis of the limits of majority voting errors for multiple classifier systems. Pattern Analysis and Applications (submitted).
No context found.
Ruta D., Gabrys B.: A theoretical analysis of the limits of majority voting errors for multiple classifier systems. To appear in the journal of Pattern Analysis and Applications.
No context found.
Ruta D, Gabrys B. A theoretical analysis of the limits of majority voting errors for multiple classifier systems. Pattern Analysis and Applications, accepted.
No context found.
D. Ruta and B. Gabrys. A theoretical analysis of the limits of majority voting errors for multiple classifier systems. Pattern Analysis and Applications, 5(4):333--350, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC