MetaAP: a meta-tree-based ranking algorithm optimizing the average precision from imbalanced data - Archive ouverte HAL
Article Dans Une Revue Pattern Recognition Letters Année : 2022

MetaAP: a meta-tree-based ranking algorithm optimizing the average precision from imbalanced data

Rémi Viola
Léo Gautheron
Amaury Habrard
Marc Sebban

Résumé

In this paper, we address the challenging problem of learning to rank from highly imbalanced data. This scenario requires to resort to specific metrics able to account the scarcity of the so-called positive examples. We present MetaAP, a tree-based ranking algorithm, which induces meta-trees by optimizing directly during the learning process the Average P recision (AP). This latter has been shown to be more relevant than the area under the ROC curve (AU C-ROC) when the objective is to push the examples of interest at the very top of the list. This effect of the AP in tree-based ranking is particularly wished to address fraud detection tasks where (i) the budget is often constrained (in terms of possible controls) and (ii) the interpretability of the induced models is required to support decision making. After an extensive comparative study on 28 public datasets showing that MetaAP is significantly better than other tree-based ranking methods, we tackle a tax fraud detection task coming from a partnership with the French Ministry of Economy and Finance. The results show that MetaAP is able to make the tax audit process much more efficient.
Fichier principal
Vignette du fichier
PRL.pdf (457.95 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03826066 , version 1 (23-10-2022)

Identifiants

Citer

Rémi Viola, Léo Gautheron, Amaury Habrard, Marc Sebban. MetaAP: a meta-tree-based ranking algorithm optimizing the average precision from imbalanced data. Pattern Recognition Letters, 2022, 161, pp.161-167. ⟨10.1016/j.patrec.2022.07.019⟩. ⟨hal-03826066⟩
45 Consultations
121 Téléchargements

Altmetric

Partager

More