Méthodes d'apprentissage statistique pour le ranking théorie, algorithmes et applications
type: Dataset
description: Multipartite ranking is a statistical learning problem that consists in ordering observations that belong to a high dimensional feature space in the same order as the labels, so that the observations with the highest label appear at the top on the list. This work aims to understand the probabilistic nature of the multipartite ranking problem in order to obtain theoretical guaranties for ranking algorithms. In that framework, the output of a ranking algorithm takes the form of a scoring function, a function that maps the space of the observations to the real line which order is induced using the values on the real line. The contributions of this manuscript are the following : first we focus on the characterization of the optimal solutions of multipartite ranking. A new condition on the likelihood ratios is introduced and shown to be necessary and sufficient to make the multipartite ranking well-posed. Then, we look at the criteria to assess the scoring function and propose to use a generalization of the ROC curve named the ROC surface. To be used in applications, the empirical counterpart of the ROC surface is studied and results on its consistency are stated. The second topic of research is the design of algorithms to produce scoring functions. The first procedure is based on the aggregation of scoring functions learnt from bipartite sub-problems. To the aim of aggregating the orders induced by the scoring function, we use a metric approach based on the Kendall- to find a median scoring function. The second procedure is a tree-based recursive method inspired by the TreeRank algorithm that can be viewed as a weighted version of CART. A simple modification is proposed to obtain an approximation of the optimal ROC surface using a piecewise constant scoring function. These procedures are compared to the state of the art algorithms for multipartite ranking using simulated and real data sets. The performances highlight the cases where our procedures are well-adapted, spec…
issued: 2026-05-07T06:35:36.068118
language: en
modified: 2026-05-07T06:35:36.068122
contact point: Organization
  fn: CCSD
keyword: agregation
keyword: arbres-de-decision
keyword: infoeu-reposemanticsdoctoralthesis
keyword: mathmath-stmathematics-mathstatistics-mathst
keyword: ranking-multipartite
keyword: statthstatistics-statstatistics-theory-statth
keyword: surface-roc
keyword: tau-de-kendall
keyword: theses
keyword: vitesses-minimax
landing page: https://theses.hal.science/tel-00936092

Méthodes d'apprentissage statistique pour le ranking théorie, algorithmes et applications
type: Distribution
format: HTML
issued: 2026-05-07T06:35:36.070961
modified: 2026-05-07T06:35:36.047220
access URL: https://theses.hal.science/tel-00936092

test_moissonnage_selune
type: Agent