Adapting decision DAGs for multipartite ranking

  • Authors:
  • José Ramón Quevedo;Elena Montañés;Oscar Luaces;Juan José Del Coz

  • Affiliations:
  • Artificial Intelligence Center, University of Oviedo at Gijón, Spain;Artificial Intelligence Center, University of Oviedo at Gijón, Spain;Artificial Intelligence Center, University of Oviedo at Gijón, Spain;Artificial Intelligence Center, University of Oviedo at Gijón, Spain

  • Venue:
  • ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multipartite ranking is a special kind of ranking for problems in which classes exhibit an order. Many applications require its use, for instance, granting loans in a bank, reviewing papers in a conference or just grading exercises in an education environment. Several methods have been proposed for this purpose. The simplest ones resort to regression schemes with a pre- and post-process of the classes, what makes them barely useful. Other alternatives make use of class order information or they perform a pairwise classification together with an aggregation function. In this paper we present and discuss two methods based on building a Decision Directed Acyclic Graph (DDAG). Their performance is evaluated over a set of ordinal benchmark data sets according to the C-Index measure. Both yield competitive results with regard to state-of-the-art methods, specially the one based on a probabilistic approach, called PR-DDAG.