Combining classifiers

We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental...

Full description

Saved in:
Bibliographic Details
Published inProceedings of 13th International Conference on Pattern Recognition Vol. 2; pp. 897 - 901 vol.2
Main Authors Kittler, J., Hater, M., Duin, R.P.W.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1996
Subjects
Online AccessGet full text
ISBN9780818672828
081867282X
ISSN1051-4651
DOI10.1109/ICPR.1996.547205

Cover

Loading…
More Information
Summary:We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental comparison of various classifier combination schemes demonstrates that the combination rule developed under the most restrictive assumptions-the sum rule-and its derivatives consistently outperform other classifier combinations schemes. A sensitivity analysis of the various schemes to estimation errors is carried out to show that this finding can be justified theoretically.
ISBN:9780818672828
081867282X
ISSN:1051-4651
DOI:10.1109/ICPR.1996.547205