The University of Southampton
University of Southampton Institutional Repository

A 'no panacea theorem' for classifier combination

A 'no panacea theorem' for classifier combination
A 'no panacea theorem' for classifier combination
We introduce the ‘No Panacea Theorem’ (NPT) for multiple classifier combination, previously proved only in the case of two classifiers and two classes. In this paper, we extend the NPT to cases of multiple classifiers and multiple classes. We prove that if the combination function is continuous and diverse, there exists a situation in which the combination algorithm will give very bad performance. The proof relies on constructing ‘pathological’ probability density distributions that have high densities in particular areas such that the combination functions give incorrect classification. Thus, there is no optimal combination algorithm that is suitable in all situations. It can be seen from this theorem that the probability density functions (pdfs) play an important role in the performance of combination algorithms, so studying the pdfs becomes the first step of finding a good combination algorithm. Although devised for classifier combination, the NPT is also relevant to all supervised classification problems
0031-3203
2665-2673
Hu, R.
81186f54-7054-488e-a9ce-20cebb8e6dda
Damper, R. I.
6e0e7fdc-57ec-44d4-bc0f-029d17ba441d
Hu, R.
81186f54-7054-488e-a9ce-20cebb8e6dda
Damper, R. I.
6e0e7fdc-57ec-44d4-bc0f-029d17ba441d

Hu, R. and Damper, R. I. (2008) A 'no panacea theorem' for classifier combination. Pattern Recognition, 41 (8), 2665-2673. (doi:10.1016/j.patcog.2008.01.022).

Record type: Article

Abstract

We introduce the ‘No Panacea Theorem’ (NPT) for multiple classifier combination, previously proved only in the case of two classifiers and two classes. In this paper, we extend the NPT to cases of multiple classifiers and multiple classes. We prove that if the combination function is continuous and diverse, there exists a situation in which the combination algorithm will give very bad performance. The proof relies on constructing ‘pathological’ probability density distributions that have high densities in particular areas such that the combination functions give incorrect classification. Thus, there is no optimal combination algorithm that is suitable in all situations. It can be seen from this theorem that the probability density functions (pdfs) play an important role in the performance of combination algorithms, so studying the pdfs becomes the first step of finding a good combination algorithm. Although devised for classifier combination, the NPT is also relevant to all supervised classification problems

This record has no associated files available for download.

More information

Published date: August 2008
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 265147
URI: http://eprints.soton.ac.uk/id/eprint/265147
ISSN: 0031-3203
PURE UUID: 0e12100d-8923-4514-a4de-fc753eb1e174

Catalogue record

Date deposited: 05 Feb 2008 16:15
Last modified: 14 Mar 2024 08:03

Export record

Altmetrics

Contributors

Author: R. Hu
Author: R. I. Damper

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×