TU Darmstadt / ULB / TUbiblio

Efficient Pairwise Classification and Ranking

Park, Sang-Hyeun and Fürnkranz, Johannes (2007):
Efficient Pairwise Classification and Ranking.
[Online-Edition: http://www.ke.informatik.tu-darmstadt.de/publications/report...],
[Report]

Abstract

Pairwise classification is a class binarization procedure that converts a multi-class problem into a series of two-class problems, one problem for each pair of classes. While it can be shown that for training, this procedure is more efficient than the more commonly used one-against-all approach, it still has to evaluate a quadratic number of classifiers when computing the predicted class for a given example. In this paper, we propose a method that allows a faster computation of the predicted class when weighted or unweighted voting are used for combining the predictions of the individual classifiers. While its worst-case complexity is still quadratic in the number of classes, we show that even in the case of completely random base classifiers, our method still outperforms the conventional pairwise classifier. For the more practical case of well-trained base classifiers, its asymptotic computational complexity seems to be almost linear. We also propose a method for approximating the full class ranking, based on the Swiss System, a common scheme for conducting multi-round chess tournaments. Our results indicate that this adaptive scheme offers a better trade-off between approximation quality and number of performed comparisons than alternative, fixed schemes for ordering the evaluation of the pairwise classifiers.

Item Type: Report
Erschienen: 2007
Creators: Park, Sang-Hyeun and Fürnkranz, Johannes
Title: Efficient Pairwise Classification and Ranking
Language: English
Abstract:

Pairwise classification is a class binarization procedure that converts a multi-class problem into a series of two-class problems, one problem for each pair of classes. While it can be shown that for training, this procedure is more efficient than the more commonly used one-against-all approach, it still has to evaluate a quadratic number of classifiers when computing the predicted class for a given example. In this paper, we propose a method that allows a faster computation of the predicted class when weighted or unweighted voting are used for combining the predictions of the individual classifiers. While its worst-case complexity is still quadratic in the number of classes, we show that even in the case of completely random base classifiers, our method still outperforms the conventional pairwise classifier. For the more practical case of well-trained base classifiers, its asymptotic computational complexity seems to be almost linear. We also propose a method for approximating the full class ranking, based on the Swiss System, a common scheme for conducting multi-round chess tournaments. Our results indicate that this adaptive scheme offers a better trade-off between approximation quality and number of performed comparisons than alternative, fixed schemes for ordering the evaluation of the pairwise classifiers.

Divisions: 20 Department of Computer Science > Knowl­edge En­gi­neer­ing
20 Department of Computer Science
Date Deposited: 24 Jun 2011 15:26
Official URL: http://www.ke.informatik.tu-darmstadt.de/publications/report...
Identification Number: TUD-KE-2007-03
Export:

Optionen (nur für Redakteure)

View Item View Item