Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm - Télécom Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm

Résumé

We consider the extension of standard decision tree methods to the bipartite ranking problem. In ranking, the goal pursued is global: define an order on the whole input space in order to have positive instances on top with maximum probability. The most natural way of ordering all instances consists in projecting the input data x onto the real line using a real-valued scoring function s and the accuracy of the ordering induced by a candidate s is classically measured in terms of the AUC. In the paper, we discuss the design of tree-structured scoring functions obtained by maximizing the AUC criterion. In particular, the connection with recursive piecewise linear approximation of the optimal ROC curve both in the L 1-sense and in the L  ∞ -sense is discussed.

Dates et versions

hal-02107171 , version 1 (23-04-2019)

Identifiants

Citer

Stéphan Clémençon, Nicolas Vayatis. Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm. Algorithmic Learning Theory, 19th International Conference, ALT 2008, Oct 2008, Budapest, Hungary. pp.22-37, ⟨10.1007/978-3-540-87987-9_7⟩. ⟨hal-02107171⟩
43 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More