Arbitrating Among Competing Classifiers Using Learned Referees

The situation in which the results of several different classifiers and learning algorithms are obtainable for a single classification problem is common. In this paper, we propose a method that takes a collection of existing classifiers and learning algorithms, together with a set of available data, and creates a combined classifier that takes advantage of all of these sources of knowledge. The basic idea is that each classifier has a particular subdomain for which it is most reliable. Therefore, we induce a referee for each classifier, which describes its area of expertise. Given such a description, we arbitrate between the component classifiers by using the most reliable classifier for the examples in each subdomain. In experiments in several domains, we found such arbitration to be significantly more effective than various voting techniques which do not seek out subdomains of expertise. Our results further suggest that the more fine grained the analysis of the areas of expertise of the competing classifiers, the more effectively they can be combined. In particular, we find that classification accuracy increases greatly when using intermediate subconcepts from the classifiers themselves as features for the induction of referees.

Authors and Affiliations

1. IBM Global Business Intelligence Solutions, Dallas, TX, USA, , , , , , US

   Julio Ortega

2. Department of Mathematics and Computer Science, Bar-Ilan University, Ramat Gan, Israel, , , , , , IL

   Moshe Koppel & Shlomo Argamon

Received 18 November 1998 / Revised 9 February 2001 / Accepted in revised form 15 March 2001

Reprints and permissions