For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Southampton

Return to search Previous output Next output
Output 1 of 187 in the submission
Article title

A `no panacea theorem' for classifier combination

Type
D - Journal article
Title of journal
Pattern Recognition
Article number
-
Volume number
41
Issue number
8
First page of article
2665
ISSN of journal
0031-3203
Year of publication
2008
Number of additional authors
1
Additional information

Significance of output:

<24>The limits of classifier combinations are specified by a theorem which is stated and proved under specific assumptions. A series of rules for classifier combination were developed in earlier work by Josef Kittler, who provided empirical support for their applicability in various conditions. The work in this paper gives formal results with which insights are obtained on the performances of such fusion rules. With these results, by checking the statistical assumptions that underlie the environment, we are able to make statements about how well classifier fusion might perform (without empirical evaluations).

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
8
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-