Machine Learning

, Volume 91, Issue 1, pp 67–104 | Cite as

Ranking data with ordinal labels: optimality and pairwise aggregation

  • Stéphan Clémençon
  • Sylvain RobbianoEmail author
  • Nicolas Vayatis


The paper describes key insights in order to grasp the nature of K-partite ranking. From the theoretical side, the various characterizations of optimal elements are fully described, as well as the likelihood ratio monotonicity condition on the underlying distribution which guarantees that such elements do exist. Then, a pairwise aggregation procedure based on Kendall tau is introduced to relate learning rules dedicated to bipartite ranking and solutions of the K-partite ranking problem. Criteria reflecting ranking performance under these conditions such as the ROC surface and its natural summary, the volume under the ROC surface (VUS), are then considered as targets for empirical optimization. The consistency of pairwise aggregation strategies are studied under these criteria and shown to be efficient under reasonable assumptions. Eventually, numerical results illustrate the relevance of the methodology proposed.


K-partite ranking Ordinal data ROC surface Volume under the ROC surface Empirical risk minimization Median ranking 

1 Introduction

In many situations, a natural ordering can be considered over a set of observations. When observations are documents in information retrieval applications, the ordering reflects degree of relevance for a specific query. In order to predict future ordering on new data, the learning process uses past data for which some relevance feedback is some provided, such as ratings, say from 0 to 4, from the poorly relevant to the extremely relevant. For an example of such data, we refer to the LETOR benchmark data repository, see A similar situation occurs in medical applications where decision-making support tools provide a scoring of the population of patients based on diagnostic test statistics in order to rank the individuals according to the advance state of a disease which are described as discrete grades, see Pepe (2003), Dreiseitl et al. (2000), Edwards et al. (2005), Mossman (1999) or Nakas and Yiannoutsos (2004) for instance.

A particular case which has received increasing attention both in machine learning the statistics literature is when only binary feedback is available (relevant vs. not relevant, ill vs. healthy) and this is known as the bipartite ranking problem (see Clémençon and Vayatis 2009b, 2010; Freund et al. 2003; Agarwal et al. 2005; Clémençon et al. 2008, etc.). In the presence of ordinal feedback (i.e. ordinal label taking a finite number of values, K≥3 say), the task consists in learning how to order temporarily unlabeled observations so as to reproduce as accurately as possible the ordering induced by the labels not observed yet. This problem is referred to as K-partite ranking and various approaches have been proposed in order to develop efficient algorithms in that case (see Rudin et al. 2005; Pahikkala et al. 2007). A closely related approach which points at both parametric and nonparametric statistical estimation is represented by ordinal regression modeling (see Waegeman et al. 2008b; Herbrich et al. 2000). To compare and assess the quality of these methods, a first concern is how to extend the typical performance measures such as the ROC curve and the AUC in this setup and this issue has been tackled in Scurfield (1996), Flach (2004). However, many interesting issues are still unexplored such as the theoretical optimality of learning rules, the statistical consistency of empirical performance maximization procedures, error bounds for K-partite ranking algorithms, ….

In the present paper, we tackle some of these open problems. In particular, we explore the connection between bipartite and K-partite ranking. Indeed, a natural approach is to transfer virtuous bipartite ranking methods to derive optimal and consistent rules for K-partite ranking. This idea is quite successful in the multiclass classification setup (see Hastie and Tibshirani 1998 or Fürnkranz 2002 for instance). We propose to build on the original proposition in Fürnkranz et al. (2009) to combine of bipartite ranking tasks in order to solve the K-partite case. A first intuition suggests that rules which are optimal for all bipartite ranking subproblems simultaneously should be optimal for the global problem. We offer examples in which this is not always the case and we state sufficient conditions for optimality which are called monotonicity likelihood ratio conditions. Based on this finding, we examine strategies which allow to combine rules dedicated for the pairwise subproblems for consecutive labels in order to derive interesting rules for the initial problem. We describe an efficient procedure for the pairwise aggregation of scoring rules which establishes a ranking consensus, called a median scoring rule, through an extension of the Kendall tau metric. It is also shown that such a median scoring rule always exists in the important situation where the scoring functions one seeks to summarize/aggregate are piecewise constant, and computation of this median rule is feasible. Next, we consider concepts such as the ROC surface and the Volume Under the ROC Surface (or VUS) which can be used to assess performance for scoring rules in K-partite ranking. Consistency can then be considered as convergence to optimal elements in terms of ROC surface or VUS. We then study conditions under which consistency of pairwise aggregation can be achieved. Indeed, it can be shown that under the monotone likelihood ratio condition together with a margin condition over the posterior distributions, the median scoring rule built out of pairwise AUC-consistent rules is VUS-consistent. We also consider specific strategies to derive scoring rules for this problem such as the empirical maximization of the VUS or the plug-in scoring rule. We also provide an analysis of the empirical performance of the Kendall-type pairwise aggregation method using the TreeRank algorithm developed by the authors (Clémençon and Vayatis 2009b). An extensive comparison with state-of-the-art ranking methods is presented both on artificial and real data sets and we exhibit performance in terms of VUS, as well as the form of the level sets of the estimated scoring rules. The latter visualization show interesting insights about the geometry of risk segments in the input space.

The rest of the paper is structured as follows. In Sect. 2, the probabilistic setting is introduced and optimal scoring rules for K-partite ranking are successively defined and characterized. A specific monotonicity likelihood ratio condition is stated, which is shown to guarantee the existence of a natural optimal ordering over the input space. A novel Kendall-type aggregation procedure is presented in Sect. 3 and performance metrics, such as the VUS, are the subject matter of Sect. 4. Consistency results and insights on the passage from bipartite subproblems to the full K-partite case are discussed in Sect. 5. Finally, Sect. 6 displays a series of numerical results and illustrations for the aggregation principle considered in this paper. Mathematical proofs are postponed to the Appendix A.

2 Optimal elements in ranking data with ordinal labels

2.1 Probabilistic setup and notations

We consider a black-box system with random input/output pair (X,Y). We assume that the input random vector X takes values over ℝ d and the output Y over the ordered discrete set \(\mathcal{Y}=\{1,\ldots , K\}\). Here it is assumed that the ordered values of the output Y can be reflected by an ordering over ℝ d . The case where K=2 is known as the bipartite ranking setup. In this paper, we focus on the case where K>2. Though the objective pursued here is different, the probabilistic setup is exactly the same as that of ordinal regression, see Sect. 5.4 for a discussion of the connections between these two problems. We denote by f k the density function of the class-conditional distributions of X given Y=k and by \(\mathcal{X}_{k} \subseteq\mathbb{R}^{d}\) the support of f k . We also set p k =ℙ{Y=k}, k∈{1,…,K}, the mixture parameter for class Y=k, and η k (x)=ℙ{Y=kX=x} the posterior probability. Set f=p 1 f 1+⋯+p K f K and recall that:
$$\forall k\in\{1, \ldots, K\}, \ \forall x\in\bigcup _{l=1}^K \mathcal{X}_l, \quad \eta_k(x) = p_k \cdot\frac{f_k}{f}(x). $$
The regression function \(\eta(x) = \mathbb{E}[Y \mid X=x]\) can be expressed in the following way:
$$\forall x\in\bigcup_{l=1}^K \mathcal{X}_l, \quad\eta(x) = \sum_{k=1}^K k \cdot\eta_k (x), $$
as the expectation of a discrete random variable. We shall make use of the following notation for the likelihood ratio of the class-conditional distribution:
$$\forall k, l\in\{1, \ldots, K\}, \ l<k , \ \forall x\in \mathcal{X}_l, \quad\varPhi_{k,l}(x)=\frac{f_k}{f_l}(x) = \frac{p_k}{p_l } \cdot\frac{\eta_k}{\eta_l}(x). $$
Along the paper, we shall use the convention that u/0=∞ for any u∈ ]0,∞[ and 0/0=0.

2.2 Optimal scoring rules

The problem considered in this paper is to infer an order relationship over ℝ d after observing vector data with ordinal labels. For this purpose, we consider real-valued decision rules of the form s : ℝ d →ℝ called scoring rules. In the case of ordinal labels, the main idea is that good scoring rules s are those which assign a high score s(X) to the observations X with large values of the label Y. We now introduce the concept of optimal scoring rule for ranking data with ordinal labels.

Definition 1

(Optimal scoring rule)

An optimal scoring rule s is a real-valued function such that:
$$\forall k, l\in\{1, \ldots, K\}, \ l<k , \ \forall x, x' \in\mathcal{X}_l, \ \varPhi_{k,l}(x)< \varPhi_{k,l} \bigl(x'\bigr) \Rightarrow s^*(x) < s^*\bigl(x'\bigr). $$

The rationale behind this definition can be understood by considering the case K=2. The class Y=2 should receive higher scores than the class Y=1. In this case, an optimal scoring rule s should score observations x in the same order as the posterior probability η 2 of the class Y=2 (or equivalently as the ratio η 2/(1−η 2)). Since η 1(x)+η 2(x)=1, for all x, it is easy to see that this is equivalent to the condition described in the previous definition (see Clémençon and Vayatis 2009b for details). In the general case (K>2), optimality of a scoring rule s means that s is optimal for all bipartite subproblems with classes Y=k and Y=l, with l<k.

An important remark is that, in the probabilistic setup introduced above, an optimal scoring rule may not exist as shown in the next example.

Example 1

Consider a discrete input space \(\mathcal{X}=\{x_{1}, x_{2}, x_{3}\}\) and K=3. We assume the following joint probability distribution ℙ(X=x i ,Y=j)=ω i,j for the random pair (X,Y):
$$\begin{array}{l} \omega_{1,1}=\omega_{2,2}=\omega_{3,3}=1/2, \\ \omega_{1,2}=\omega_{2,3}=\omega_{3,1}=1/3, \\ \omega_{1,3}=\omega_{2,1}=\omega_{3,2}=1/6. \end{array} $$
Note that in the case of a discrete distribution for X, the density function coincides with mass function and we have f(x)=ℙ(X=x). It is then easy to check that, in this case, there is no optimal scoring rule for this distribution in the sense of Definition 1.

2.3 Existence and characterization of optimal scoring rules

The previous example shows that the existence of optimal scoring rules cannot be guaranteed under any joint distribution. Our first important result is the characterization of those distributions for which the family of optimal scoring rules is not an empty set. The next proposition offers a necessary and sufficient condition on the distribution which ensures the existence of optimal scoring rules.

Assumption 1

For any k,l∈{1,…,K} such that l<k, for all \(x,x'\in \mathcal{X}\), we have:
$$\varPhi_{k+1,k}(x)< \varPhi_{k+1,k}\bigl(x'\bigr) \Rightarrow\varPhi_{l+1,l}(x)\leq\varPhi_{l+1,l}\bigl(x' \bigr). $$

Proposition 1

The following statements are equivalent:
  1. (1)

    Assumption 1 holds.

  2. (2)

    There exists an optimal scoring rule s .

  3. (3)

    The regression function \(\eta(x) = \mathbb{E}(Y \mid X=x)\) is an optimal scoring rule.

  4. (4)
    For any k∈{1,…,K−1}, for all \(x,x'\in\mathcal{X}_{k}\), we have:
    $$\varPhi_{k+1,k}(x)< \varPhi_{k+1,k}\bigl(x'\bigr) \Rightarrow s^*(x)< s^*\bigl(x'\bigr). $$
  5. (5)

    For any k,l∈{1,…,K} such that l<k, the ratio Φ k,l (x) is a nondecreasing function of s (x).


Assumption 1 characterizes the class distributions for the random pair (X,Y) for which the very concept of an optimal scoring rules makes sense. The proposition says that if this condition is not satisfied then the ordinal nature of the labels, when seen through the observation X, is violated. We point out that a related condition, called ERA ranking representability, has been introduced in Waegeman and Baets (2011), see Definition 2.1 therein. Precisely, it can be easily checked that the condition in the previous proposition means that the collection of (bipartite) ranking functions {Φ k+1,k :1≤k<K} is an ERA ranking representable set of ranking functions. Statement (3) suggests that plug-in rules based on the statistical estimation of the regression function η and multiple thresholding of the estimate will offer candidates for practical resolution of K-partite ranking. Such strategies are indeed reminiscent of ordinal logistic regression methods and will be discussed in Sect. 5.3.2. Statement (4) offers an alternative characterization to Definition 1 for optimal scoring rules. Statement (5) means that the family of densities of the class-conditional distributions f k has a monotone likelihood ratio (we refer to standard textbooks of mathematical statistics which use this terminology, e.g. Lehmann and Romano 2005).

Proposition 2

Under Assumption 1 we necessarily have:
$$\mathcal{X}_{k'}\cap\mathcal{X}_{l'}\subseteq\mathcal{X}_{k}\cap \mathcal{X}_{l}\quad \mathrm{for\ any}\ k, k', l, l'\ \mathrm{such\ that}\ 1 \leq k'\leq k <l\leq l'\leq K. $$

2.4 Examples and counterexamples of monotone likelihood ratio families

It is easy to see that, in absence of Assumption 1, the notion of K-partite ranking hardly makes sense. However, it is a challenging statistical task to assess whether data arise from a mixture of distributions F k with monotone likelihood ratio. We now provide examples and counterexamples of such cases.

Disjoint supports

Consider the separable case where: ∀k,l, \(\mathcal{X}_{k} \cap\mathcal{X}_{l} = \emptyset\). Then Assumption 1 is clearly fulfilled as for kl, we have either Φ k,l =0 or ∞. It is worth mentioning that in this case, the nature of the K-partite ranking problem does not differ from the multiclass classification setup where there is no order relation between classes.

Exponential families

We recall that \(f = \sum_{k=1}^{K} p_{k} f_{k}\) is the marginal distribution function of X. We introduce the following choice for the class-conditional distributions f k :
$$f_k(x) =\exp\bigl\{\kappa(k)T(x)-\psi(k)\bigr\} f(x), \quad \forall x \in\mathbb{R}^d, $$
  • κ:{1,…,K}→ℝ is strictly increasing,

  • T:ℝ d →ℝ such that \(\psi(k)=\int_{x\in\mathbb{R}^{d}}\exp\{\kappa(k)T(x)\}f(x) dx<+\infty\), for 1≤kK.

It is easy to check that he family of density functions f k has the property of monotone likelihood ratio.

1-D Gaussian distributions

We consider here a toy example with K=3 and the f k are Gaussian distributions \(\mathcal {N}(m_{k}, \sigma^{2}_{k})\) over ℝ, where m k is the expectation and \(\sigma^{2}_{k}\) is the variance. Depending on the values of the parameters \(m_{k}, \sigma^{2}_{k}\), the collection {f 1,f 2,f 3} may or may not satisfy the property of having a monotone likelihood ratio. Assume first that the variances are equal, then the property of monotone likelihood ratio is satisfied if and only if either m 1m 2m 3 or m 3m 2m 1 (see Fig. 1(a)). Figure 1(b) depicts a situation where m 1<m 2<m 3 and \(\sigma^{2}_{3}>\sigma^{2}_{2}=\sigma^{2}_{1}\) for which the random observation X does not permit to recover the preorder induced by the output variable. The monotonicity condition is violated for instance at (x,x′)=(−2,1) and there is no optimal scoring rule in this case.
Fig. 1

Two examples of 1-D conditional Gaussian distributions in the case K=3—class 1 in green, class 2 in blue and class 3 in red

Uniform noise

Let t 0=−∞<t 1<⋯<t K−1<+∞ and g:ℝ d →ℝ a measurable function. We define the output random variable through:
$$Y=\sum_{k=1}^{K}\mathbb{I}\bigl \{g(X)+U>t_{k-1}\bigr\}, $$
where U is a uniform random variable on some interval of the real line, independent from X. Then it can be easily seen that the class-conditional distributions form a collection with monotone likelihood ratio, provided that t 1 and t K−1 both lie inside the interval defined by the essential infimum and supremum of the random variable g(X)+U. In this case, any strictly increasing transform of g is an optimal scoring rule.

3 Pairwise aggregation: from bipartite to K-partite ranking

In the present section, we propose a practical strategy for building scoring rules which approximate optimal scoring rules for K-partite ranking based on data. The principle of this strategy is the aggregation of scoring rules obtained for the pairwise subproblems. We emphasize the fact that the situation is very different from multiclass classification where aggregation boils down to linear combination, or majority voting, over binary classifiers (for “one against one” and “one versus all”, we refer to Allwein et al. 2001; Hastie and Tibshirani 1998; Venkatesan and Amit 1999; Debnath et al. 2004; Dietterich and Bakiri 1995; Beygelzimer et al. 2005a, 2005b and the references therein for instance). We propose here, in the K-partite ranking setup, a metric-based barycentric approach to build the aggregate scoring rule from the collection of scoring rules estimated for the bipartite subproblems. In order to avoid technical discussions dealing with special cases, we assume in the sequel that all class-conditional distributions have a continuous density f k and share the same support \(\mathcal{X}\subset\mathbb{R}^{d}\).

3.1 Median scoring rules and optimal aggregation

Every scoring rule induces an order relation over the input space ℝ d and, for the ranking problem considered here, a measure of similarity between two scoring functions should only take into consideration the similarity in the ranking induced by each one of them. We propose here a measure of agreement between scoring rules which is based on the probabilistic Kendall τ for a pair of random variables.

Definition 2

(Probabilistic Kendall τ)

Consider X,X′ i.i.d. random vectors with density function f over ℝ d . The measure of agreement between two real-valued scoring rules s 1 and s 2 is defined as the quantity:

This definition of agreement between scoring rules s 1 and s 2 coincides indeed with the Kendall τ between real-valued random variables s 1(X) and s 2(X). Note that the contribution of the two last terms in the definition of τ(s 1,s 2) vanishes when the distributions of the s i (X)’s are continuous.

From there one can define the notion of median scoring rule which accounts for the consensus of many real-valued scoring rules over a given class of candidates.

Definition 3

(Median scoring rule)

Consider a given class \(\mathcal{S}_{1}\) of real-valued scoring rules and Σ K ={s 1,…,s K−1} a finite set of real-valued scoring rules. A median scoring rule \(\overline{s}\) for \((\mathcal{S}_{1}, \varSigma_{K})\) satisfies:
$$ \sum_{k=1}^{K-1}\tau (\overline{s}, s_k )= \sup_{s\in\mathcal{S}_1} \sum_{k=1}^{K-1}\tau(s, s_k ). $$

In general, the supremum appearing on the right hand side of Eq. (1) is not attained. However, when the supremum over \(\mathcal{S}_{1}\) can be replaced by a maximum over a finite set \(\mathcal{S}'_{1}\subset \mathcal{S}_{1}\), a median scoring rule always exists (but it is not necessarily unique). In particular, this is the case when considering piecewise constant scoring functions such as those produced by the bipartite ranking algorithms proposed in Clémençon et al. (2011a), Clémençon and Vayatis (2009a, 2010) (we also refer to Clémençon and Vayatis 2009c for a discussion of consensus computation/approximation in this case). The idea underlying the measure of consensus through Kendall metric in order to aggregate scoring functions that are nearly optimal for bipartite ranking subproblems is clarified by the following result.

Definition 4

(Pairwise optimal scoring rule)

A pairwise optimal scoring rule \(s_{l,k}^{*}\) is an optimal scoring rule for the bipartite ranking problem with classes Y=k and Y=l, where k>l in the sense that:
$$\forall x, x' \in\mathcal{X}, \ \varPhi_{k,l}(x)< \varPhi_{k,l}\bigl(x'\bigr) \Rightarrow s_{l,k}^*(x) < s_{l,k}^*\bigl(x'\bigr). $$

We denote by \(\mathcal{S}^{*}_{l,k}\) the set of such optimal rules and, in particular, \(\mathcal{S}^{*}_{k} = \mathcal{S}^{*}_{k, k+1}\).

Proposition 3

Denote by \(\mathcal{S}\) the set of all possible real-valued scoring rules and consider pairwise optimal scoring rules \(s_{k}^{*} \in\mathcal{S}^{*}_{k}\) for k=1,…,K−1, which form the set \(\varSigma_{K}^{*} = \{s_{1}^{*}, \ldots, s_{K-1}^{*} \}\). Under Assumption 1, we have:
  1. 1.

    A median scoring rule \(\overline{s}^{*}\) for \((\mathcal{S}, \varSigma ^{*}_{K})\) is an optimal scoring rule for the K-partite ranking problem.

  2. 2.
    Any optimal scoring rule s for the K-partite ranking problem satisfies:
    $$\sum_{k=1}^{K-1} \tau\bigl(s^*,s^*_k\bigr) = K-1. $$

The proposition above reveals that “consensus scoring rules”, in the sense of Definition 3, based on K−1 optimal scoring rules are still optimal solutions for the global K-partite ranking problem and that, conversely, optimal elements necessarily achieve the equality in Statement (2) of the previous proposition. This naturally suggests to implement the following two-stage procedure, that consists in (1) solving the bipartite ranking subproblem related to the pairwise case (k,k+1) of consecutive class labels, yielding a scoring function s k , for 1≤k<K, and (2) computing a median according to Definition 3, when feasible, based on the latter over a set \(\mathcal{S}_{1}\) of scoring functions. Beyond the difficulty to solve each ranking subproblem separately (for instance refer to Clémençon and Vayatis 2009b for a discussion of the nature of the bipartite ranking issue), the performance/complexity of the method sketched above is ruled by the richness of the class \(\mathcal{S}_{1}\) of scoring function candidates: too complex classes clearly make median computation unfeasible, while poor classes may not contain sufficiently accurate scoring rules.

3.2 A practical aggregation procedure

We now propose to convert the previous theoretical results which relate pairwise optimality to K-partite optimality in ranking into a practical aggregation procedure. Consider two independent samples:
  • a sample \(\mathcal{D}=\{(X_{i},Y_{i}){:}\; 1\leq i \leq n \} \) with i.i.d. labeled observations,

  • a sample \(\mathcal{D}'=\{X'_{i},{:}\; 1\leq i \leq n' \}\) a sample with unlabeled observations.

The first sample \(\mathcal{D}\) is used for training bipartite ranking rules \(\hat{s}_{k}\), while the second sample \(\mathcal{D}'\) will be used for the computation of the median. In practice a proxy for the median is computed based on the empirical version of the Kendall τ, the following U-statistic of degree two, see Clémençon et al. (2008).

Definition 5

(Empirical Kendall τ)

Given a sample X 1,…,X n , the empirical Kendall τ is given by:
$$\widehat{\tau}_n (s_1, s_2)= \frac{2}{n(n-1)}\sum_{1\leq i<j \leq n} h \bigl( \bigl(s_1(X_i), s_1(X_j)\bigr),\bigl(s_2(X_i), s_2(X_j)\bigr)\bigr), $$
where for (v,w) and (v′,w′) in ℝ2.
Denote by \(\mathcal{D}_{k} = \{ (X_{i}, Y_{i}) \in\mathcal{D}{:}\; Y_{i} = k\}\). The following aggregation method describes a two-steps procedure which takes as input the two data sets, a class \(\mathcal{S}_{1}\) of candidate scoring rules, and a generic bipartite ranking algorithm \(\mathcal {A}\).

Practical implementation issues

Motivated by practical problems such as the design of meta-search engines, collaborative filtering or combining results from multiple databases, consensus ranking, which the second stage of the procedure described above is a special case of, has recently enjoyed renewed popularity and received much attention in the machine-learning literature, see Meila et al. (2007), Fagin et al. (2004) or Lebanon and Lafferty (2002) for instance. As shown in Hudry (2008) or Wakabayashi (1998) in particular, median computations are NP-hard problems in general. Except in the case where \(\mathcal {S}_{1}\) is of very low cardinality, the (approximate) computation of a supremum involves in practice the use of meta-heuristics such as simulated annealing, tabu search or genetic algorithms. The description of these computational approaches to consensus ranking is beyond the scope of this paper and we refer to Barthélemy et al. (1989), Charon and Hudry (1998), Laguna et al. (1999) or Mandhani and Meila (2009) and the references therein for further details on their implementation. We also underline that the implementation of the Kendall aggregation approach could be naturally based on K(K−1)/2 scoring functions, corresponding to solutions of the bipartite subproblems defined by all possible pairs of labels (the theoretical analysis carried out below can be straightforwardly extended so as to establish the validity of this variant), at the price of an additional computational cost for the median computation stage however.

Rank prediction vs. scoring rule learning

When the goal is to rank accurately new unlabeled datasets, rather than to learn a nearly optimal scoring rule explicitly, the following variant of the procedure described above can be considered. Given an unlabeled sample of i.i.d. copies of the input r.v. X \(\mathcal{D}_{X}=\{ X_{1},\ldots,X_{m} \}\), instead of aggregating scoring functions s k defined on the feature space \(\mathcal{X}\) and use a consensus rule for ranking the elements of \(\mathcal{D}_{X}\), one may aggregate their restrictions to the finite set \(\mathcal{D}_{X}\subset\mathcal {X}\), or simply the ranks of the unlabeled data as defined by the s k ’s.

4 Performance measures for K-partite ranking

We now turn to the main concepts for assessing performance in the K-partite ranking problem. We focus on the notion of ROC surface and Volume Under the ROC Surface (VUS) in the case where K=3 in order to keep the presentation simple. These concepts are generalizations of the well-known ROC curve and AUC criterion which are popular performance measures for bipartite ranking.

4.1 ROC surface

Given a scoring rule s:ℝ d →ℝ, the ROC surface offers a visual display which reflects how the conditional distributions of s(X) given the class label Y=k are separated between each other as k=1,…,K. We introduce the notation F s,k for the cumulative distribution function (cdf) over the real line ℝ of the random variable s(X) given the class label Y=k:
$$\forall t\in\mathbb{R}, \quad F_{s,k}(t) = \mathbb{P}\bigl\{ s(x) \le t \mid Y=k\bigr\} . $$

Definition 6

(ROC surface)

Let K≥2. The ROC surface of a real-valued scoring rule s is defined as the plot of the continuous extension of the parametric surface in the unit cube [0,1] K : where Δ={(t 1,…,t K−1)∈ℝ K−1:t 1<⋯<t K−1}.

By “continuous extension”, it is meant that discontinuity points, due to jumps or flat parts in the cdfs F s,k , are connected by linear segments (parts of hyperplanes). The same convention is considered in the definition of the ROC curve in the bipartite case given in Clémençon and Vayatis (2009b). In the case K=3, on which we restrict our attention from now for simplicity (all results stated in the sequel can be straightforwardly extended to the general situation), the ROC surface thus corresponds to a continuous manifold of dimension 2 in the unit cube of ℝ3. We also point out that the ROC surface contains the ROC curves of the pairwise problems (f 1,f 2), (f 2,f 3) and (f 1,f 3) which can be obtained as the intersections of the ROC surface with planes orthogonal to each of the axis of the unit cube.

In order to keep track of the relationship between the ROC surface and its sections, we introduce the following notation:
$$\forall\alpha\in[0,1], \quad\mathrm{ROC}_{f_k,f_{k+1}}(s,\alpha )=1-F_{s,k+1}\circ F_{s,k}^{-1}(1-\alpha), $$
where we have used the following definition of the generalized inverse of a cdf F: F −1(u)=inf{t∈ ]−∞,+∞]: F(t)≥u}, u∈[0,1].

Proposition 4

(Change of parameterization)

The ROC surface of the scoring rule s can be obtained as the plot of the continuous extension of the parametric surface: where with the notation u +=max(0,u), for any real number u.

We point out that, in the case where s has no capacity to discriminate between the three distributions, i.e. when F s,1=F s,2=F s,3, the ROC surface boils down to the surface delimited by the triangle that connects the points (1,0,0), (0,1,0) and (0,0,1), we then have ROC(s,α,γ)=1−αγ. By contrast, in the separable situation (see Sect. 2.4), the optimal ROC surface coincides with the surface of the unit cube [0,1]3.

The next lemma characterizes the support of the function whose plot corresponds to the ROC surface (see Fig. 2).
Fig. 2

Plot of the ROC surface of a scoring function

Lemma 1

For any (α,γ)∈[0,1]2, the following statements are equivalent:
  1. 1.


  2. 2.

    \(\mathrm{ROC}_{f_{1},f_{3}}(s,1-\alpha) >\gamma\).


Other notions of ROC surface have been considered in the literature, depending on the learning problem considered and the goal pursued. In the context of multi-class pattern recognition, they provide a visual display of classification accuracy, as in Ferri et al. (2003) (see also Fieldsend and Everson 2005, 2006 and Hand and Till 2001) from a one-versus-one angle or in Flach (2004) when adopting the one-versus-all approach. The concept of ROC analysis described above is more adapted to the situation where a natural order on the set of labels exists, just like in ordinal regression, see Waegeman et al. (2008b).

4.2 ROC-optimality and optimal scoring rules

The ROC surface provides a visual tool for assessing ranking performance of a scoring rule. The next theorem provides a formal statement to justify this practice.

Theorem 1

The following statements are equivalent:
  1. 1.

    Assumption 1 is fulfilled and s is an optimal scoring rule in the sense of Definition 1.

  2. 2.
    We have, for any scoring rule s and for all (α,γ)∈[0,1]2,
    $$\mathrm{ROC}(s,\alpha,\gamma)\leq\mathrm{ROC}\bigl(s^*,\alpha ,\gamma\bigr). $$

A nontrivial byproduct of the proof of the previous theorem is that optimizing the ROC surface amounts to simultaneously optimizing the ROC curves related to the two pairs of distributions (f 1,f 2) and (f 2,f 3).

The theorem indicates that optimality for scoring rules in the sense of Definition 1 is equivalent to optimality in the sense of the ROC surface. Therefore, the ROC surface provides a complete characterization of the ranking performance of a scoring rule in the K-partite problem.

We now introduce the following notations: for any α∈[0,1] and any scoring rule s,
  • the quantile of order (1−α) of the conditional distribution of the random variable s(X) given Y=k:
    $$Q^{(k)}(s,\alpha) = F^{-1}_{s, k}(1-\alpha), $$
  • the level set of the scoring rule s with the top elements of class Y=k:
    $$R^{(k)}_{s,\alpha}=\bigl\{x\in\mathcal{X}|s(x)>Q^{(k)}(s,\alpha) \bigr\} . $$

Proposition 5

Suppose that Assumption 1 is fulfilled and consider s an optimal scoring rule in the sense of Definition 1. Also assume that η(X) is a continuous random variable, then we have: ∀(α,γ)∈[0,1]2:
$$\mathrm{ROC}^{*} \bigl(s^*, \alpha,\gamma\bigr)-\mathrm {ROC}(s,\alpha,\gamma )\leq \mathbb{I}\bigl\{ \gamma\leq\mathrm{ROC}_{F_1,F_3}\bigl (s^*,1-\alpha \bigr)\bigr\} \cdot\bigl( \varTheta_1(s,\alpha)+\varTheta_2(s,\gamma) \bigr), $$
where We have used the notation AΔB=(AB)∪(BA) for the symmetric difference between sets A and B.

The previous proposition provides a key inequality for the statistical results developed in the sequel.

4.3 Volume Under the ROC Surface (VUS)

In the bipartite case, a standard summary of ranking performance is the Area Under an ROC Curve (or AUC). In a similar manner, one may consider the volume under the ROC surface (VUS in abbreviated form) in the three-class framework. We follow here Scurfield (1996) but we mention that other notions of ROC surface can be found in the literature, leading to other summary quantities, also referred to as VUS, such as those introduced in Hand and Till (2001).

Definition 7

(Volume Under the ROC Surface)

We define the VUS of a real-valued scoring rule s as:
$$\mathrm{VUS}(s) = \int_{0}^1\int_0^1 \mathrm{ROC}(s,\alpha,\gamma)\, \mathrm{d}\alpha\,\mathrm{d}\gamma. $$
An alternative expression of VUS can be derived with a change of parameters:

The next proposition describes two extreme cases.

Proposition 6

Consider a real-valued scoring rule s.
  1. 1.

    If F s,1=F s,2=F s,3, then VUS(s)=1/6.

  2. 2.

    If the density functions of F s,1, F s,2, F s,3 have disjoint supports, then VUS(s)=1.


Like the AUC criterion, the VUS can be interpreted in a probabilistic manner. For completeness, we recall the following result.

Proposition 7

(Scurfield 1996)

For any scoring function \(s\in\mathcal{S}\), we have: where (X 1,Y 1), (X 2,Y 2) and (X 3,Y 3) denote independent copies of the random pair (X,Y).

In the case where the distribution of s is continuous, the last three terms in the term on the right hand side vanish and the VUS boils down to the probability that, given three random instances X 1, X 2 and X 3 with respective labels Y 1=1, Y 2=2 and Y 3=3, the scoring rule s ranks them in the right order.

4.4 VUS-optimality

We now consider the notion of optimality with respect to the VUS criterion and provide expressions of the deficit of VUS for any scoring rule which highlight the connection with AUC maximizers for the bipartite subproblems.

Proposition 8

(VUS optimality)

Under Assumption 1, we have, for any real-valued scoring rule s and any optimal scoring rule s :
$$\mathrm{VUS}(s)\leq\mathrm{VUS}\bigl(s^*\bigr). $$
We denote the maximal value of the VUS by VUS=VUS(s )

This result shows that optimal scoring rules in the sense of Definition 1 coincide with optimal elements in the sense of VUS. This simple statement grounds the use of empirical VUC maximization strategies for the K-partite ranking problem.

When the Assumption 1 is not fulfilled, the VUS can still be used as a performance criterion, both in the multiclass classification context (Landgrebe and Duin 2006; Ferri et al. 2003) and in the ordinal regression setup (Waegeman et al. 2008b). However, the interpretation of maximizers of VUS as optimal orderings is highly questionable. For instance, in the situation described in Example 1, one may easily check that, when ω 1,1=4/11, ω 1,2=6/11, ω 1,3=ω 3,1=1/11, ω 2,1=ω 2,2=3/11 and ω 2,3=ω 3,2=ω 3,3=5/11, the maximum VUS (equal to 0.2543) is reached by the scoring rule corresponding to strict orders ≺ and ≺′, such that x 3x 2x 1 and x 2≺′x 3≺′x 1 respectively, both at the same time.

We introduce the definition for the AUC of the bipartite ranking problem with the pair of distributions (f k ,f k+1):

Definition 8


Let X 1 and X 2 independent random variables with distribution f k and f k+1 respectively. We set:
$$\mathrm{AUC}_{f_{k},f_{k+1}}(s)=\mathbb{P} \bigl\{s(X_1)<s(X_2) \bigr\}+\frac {1}{2}\mathbb{P} \bigl\{s(X_1)=s(X_2) \bigr\} . $$

We now state the result which establishes the relevance of AUC as an optimality criterion for the bipartite ranking problem.

Proposition 9

Fix k∈{1,…,K−1} and consider \(s^{*}_{k}\) a pairwise optimal scoring rule according to Definition 4. Then we have, for any scoring rule:
$$\mathrm{AUC}_{f_{k},f_{k+1}}(s) \le\mathrm{AUC}_{f_{k},f_{k+1}}\bigl (s^*_k\bigr) . $$
Moreover, we denote the maximal value of the AUC for the bipartite (f k ,f k+1) ranking problem by: \(\mathrm{AUC}^{*}_{f_{k},f_{k+1}} = \mathrm{AUC} _{f_{k},f_{k+1}}(s^{*}_{k})\).

The next result makes clear that if a scoring rule s solves simultaneously all the bipartite ranking subproblems then it also solves the global K-partite ranking problem. For simplicity, we present the result in the case K=3.

Theorem 2

(Deficit of VUS)

Suppose that Assumption 1 is fulfilled. Then, for any scoring rule s and any optimal scoring rule s , we have

5 Consistency of pairwise aggregation and other strategies for K-partite ranking

5.1 Definition of VUS-consistency and main result

In this section, we assume a data sample \(\mathcal{D}_{n}=\{(X_{1},Y_{1}), \ldots, (X_{n},Y_{n})\}\) is available and composed by n i.i.d. copies of the random pair (X,Y). Our goal here is to learn from the sample \(\mathcal{D}_{n}\) how to build a real-valued scoring rule \(\widehat{s}_{n}\) such that its ROC surface is as close as possible to the optimal ROC surface. We propose to consider a weak concept of consistency which relies on the VUS.

Definition 9


Suppose that Assumption 1 is fulfilled. Let (s n ) n≥1 be a sequence of random scoring rules on ℝ d , then:
  • the sequence {s n } is called VUS-consistent if
    $$\mathrm{VUS}^*-\mathrm{VUS}(s_n)\rightarrow0 \quad\text{in probability}, $$
  • the sequence {s n } is called strongly VUS-consistent if
    $$\mathrm{VUS}^*-\mathrm{VUS}(s_n)\rightarrow0\quad\text{with probability one}. $$

Remark 1

We note that the deficit of VUS can be interpreted as an L 1 distance between ROC surfaces of s n and s :
$$\mathrm{VUS}^*-\mathrm{VUS}(s_n)=\int\int_{(\alpha,\gamma)\in [0,1]^2}\bigl\vert \mathrm{ROC} \bigl(s^*,\alpha,\gamma\bigr) -\mathrm{ROC}(s_n,\alpha,\gamma )\bigr \vert\, \mathrm{d}\alpha\,\mathrm{d}\gamma, $$
and in this sense the notion of consistency is weak. Indeed, a stronger sense of consistency could be given by considering the supremum norm between surfaces:
$$d_{\infty}\bigl(s^*,s_n\bigr)=\sup_{(\alpha,\gamma)\in [0,1]^2}\bigl\vert\mathrm{ROC} \bigl(s^*,\alpha,\gamma\bigr) -\mathrm{ROC}(s_n,\alpha,\gamma )\bigr \vert. $$
The study of accuracy of K-partite ranking methods in this sense is beyond the scope of the present paper (in contrast to the L 1 norm, the quantity d (s ,s) cannot be decomposed in an additive manner). Extensions of bipartite ranking procedures such as the TreeRank and the RankOver algorithms (see Clémençon and Vayatis 2009b and 2010), for which consistency in supremum norm is guaranteed under some specific assumptions, will be considered in future work.

In order to state the main result, we need an additional assumption on the distribution of the random pair (X,Y). The reason why this assumption is needed will be explained in the next section.

Assumption 2

For all k∈{1,…,K−1}, the (pairwise) posterior probability given by η k+1(X)/(η k (X)+η k+1(X)) is a continuous random variable and there exist c<∞ and a∈(0,1) such that
$$ \forall x\in\mathcal{X},\quad \mathbb{E} \biggl[\biggl\vert \frac{\eta_{k+1}(X)}{\eta_{k+1}(X)+\eta_k(X)}-\frac{\eta _{k+1}(x)}{\eta_{k+1}(x) +\eta_k(x)}\biggr\vert^{-a} \biggr]\leq c. $$

In the statistical learning literature, Assumption 2 is referred to as the noise condition and goes back to the work of Tsybakov (2004). It has been adapted to the framework of bipartite ranking in Clémençon et al. (2008). For completeness, we state a result from this latter paper (see Corollary 8 within) which offers a simple sufficient condition for the Assumption 2 to be fulfilled.

Proposition 10

If the distribution of the r.v. η k+1(X)/(η k (X)+η k+1(X)) has a bounded density, then Assumption 2 is satisfied.

We will also need to use the notion of AUC consistency for the bipartite ranking subproblems.

Definition 10

(AUC consistency)

For k fixed in {1,…,K−1}, a sequence (s n ) n≥1 of scoring rules is said to be AUC-consistent (respectively, strongly AUC-consistent) for the bipartite problem (f k ,f k+1) if it satisfies:
$$\mathrm{AUC}_{f_k, f_{k+1}}(s_n) \rightarrow\mathrm{AUC}^*_{f_k, f_{k+1}}\ \text{in probability (resp., with probability one).} $$

We can now state the main consistency result of the paper which concerns the Kendall aggregation procedure described in Sect. 3.2. Indeed, the following theorem reveals that the notion of median scoring rule introduced in Definition 3 preserves AUC consistency for bipartite subproblems and thus yields a VUS consistent scoring rule for the K-partite problem. It is assumed that the solutions to the bipartite subproblems are AUC-consistent for each specific pair of class distributions (f k ,f k+1), 1≤k<K. For simplicity, we formulate the result in the case K=3.

Theorem 3

We consider a class of candidate scoring rules \(\mathcal{S}_{1}\), \((s^{(1)}_{n})_{n\geq1}\), \((s^{(2)}_{n})_{n\geq1}\) two sequences of scoring rules in \(\mathcal{S}_{1}\). We use the notation \(\varSigma _{2,n} = \{ s^{(1)}_{n},s^{(2)}_{n}\}\). Assume the following:
  1. 1.

    Assumptions 1 and 2 hold true.

  2. 2.

    The class \(\mathcal{S}_{1}\) contains an optimal scoring rule.

  3. 3.

    The sequences \((s^{(1)}_{n})_{n\geq1}\) and \((s^{(2)}_{n})_{n\geq1}\) are (strongly) AUC-consistent for the bipartite ranking subproblems related to the pairs of distributions (f 1,f 2) and (f 2,f 3) respectively.

  4. 4.

    Assume that, for all n, there exists a median scoring rule \(\overline{s}_{n}\) in the sense of Definition 3 with respect to \((\mathcal{S}_{1}, \varSigma_{2,n})\).

Then the median scoring rule \(\overline{s}_{n}\) is (strongly) VUS-consistent.


The first assumption of Theorem 3 puts a restriction on the class of distributions for which such a consistency result holds. Assumption 1 actually guarantees that the very problem of K-partite makes sense and the existence of an optimal scoring rule. Assumption 2 can be seen as a “light” restriction since it still covers a large class of distributions commonly used in probabilistic modeling. The third and fourth assumptions are natural as we expect first to have efficient solutions to the bipartite subproblems before considering reasonable solutions to the K-partite problem. The most restrictive assumption is definitely the second one about the fact that the class of candidates contains an optimal element. Indeed, it is easy to weaken this assumption at the price of an additional bias term by assuming that the scoring rules \(s^{(1)}_{n}\), \(s^{(2)}_{n}\) and \(\overline{s}_{n}\) belong to a set \(\mathcal{S}_{1}^{(n)}\), such that there exists a sequence \((s_{n}^{*})_{n\geq1}\) with \(s_{n}^{*}\in\mathcal{S}_{1}^{(n)}\) and \(\mathrm{VUS} (s_{n}^{*})\rightarrow\mathrm{VUS}^{*}\) as n→∞. We decided not to include this refinement as this is merely a technical argument which does not offer additional insights on the nature of the problem.

5.2 From AUC consistency to VUS consistency

In this section, we introduce auxiliary results which contribute to the proof of the main theorem (details are provided in the Appendix). Key arguments rely on the relationship between the solutions of the bipartite ranking subproblems and those of the K-partite problem. In particular, a sequence of scoring rules that is simultaneously AUC-consistent for the bipartite ranking problems related to the two pairs of distributions (f 1,f 2) and (f 2,f 3) is VUS-consistent. Indeed, we have the following corollary.

Corollary 1

Suppose that Assumption 1 is satisfied. Let (s n ) n≥1 be a sequence of scoring rules. The following assertions are equivalent.
  1. (i)

    The sequence (s n ) n of scoring rules is (strongly) VUS-optimal.

  2. (ii)
    We have simultaneously when n→∞: (with probability one) in probability.

It follows from this result that the 3-partite ranking problem can be cast in terms of a double-criterion optimization task, consisting in finding a scoring rule s that simultaneously maximizes \(\mathrm{AUC}_{f_{1},f_{2}}(s)\) and \(\mathrm{AUC}_{f_{2},f_{3}}(s)\). This result provides a theoretical basis for the justification of our pairwise aggregation procedure. We mention that the idea of decomposing the K-partite ranking into several bipartite ranking subproblems has also been considered in Fürnkranz et al. (2009) but the aggregation stage is performed with a different strategy.

The other type of result which is needed concerns the connection between the aggregation principle based on a consensus approach (Kendall τ) and the performance metrics involved in the K-partite ranking problem. The next results establish inequalities which relate the AUC and the Kendall τ in a quantitative manner.

Proposition 11

Let p be a real number in (0,1). Consider two probability distributions f k and f k +1 on the set  \(\mathcal{X}\). We assume that the distribution of X comes from the mixture with density function given by (1−p)f k +pf k+1. For any real-valued scoring rules s 1 and s 2 on  d , we have:
$$ \bigl\vert\mathrm{AUC}_{f_k,f_{k+1}}(s_1)-\mathrm{AUC}_{f_k,f_{k+1}}(s_2) \bigr\vert\leq\frac {1-\tau(s_1,s_2 )}{4p(1-p)}. $$

We point out that it is generally vain to look for a reverse control: indeed, scoring functions yielding different rankings may have exactly the same AUC. However, the following result guarantees that a scoring function with a nearly optimal AUC is close to optimal scoring functions in a certain sense, under the additional assumption that the noise condition introduced in Clémençon et al. (2008) is fulfilled.

Proposition 12

Under Assumption 2, we have, for any k∈{1,…,K−1}, for any scoring rule s and any pairwise optimal scoring rule  \(s_{k}^{*}\):
$$ 1-\tau\bigl(s_k^*,s \bigr) \le C\cdot\bigl(\mathrm{AUC}_{f_k,f_{k+1}}^*- \mathrm{AUC}_{f_k,f_{k+1}}(s) \bigr)^{a/(1+a)}, $$
with C=3c 1/(1+a)⋅(2p k p k+1) a/(1+a).

5.3 Alternative approaches to K-partite ranking

In this section, we also mention, for completeness, two other approaches to K-partite ranking.

5.3.1 Empirical VUS maximization

The first approach extends the popular principle of empirical risk minimization, see Vapnik (1999). For K-partite ranking, this programme has been carried out in Rajaram and Agarwal (2005) with an accuracy measure based on the loss function \((Y-Y')^{\xi}_{+}({\mathbb{I}}\{ s(X)<s(X')\} + (1/2)\cdot{\mathbb {I}}\{ s(X)=s(X')\})\), with ξ≥0. In our setup, the idea would be to optimize a statistical counterpart of the unknown functional VUS(.) over a class \(\mathcal{S}_{1}\) of candidate scoring rules. Based on the training dataset \(\mathcal{D}_{n}\), a natural empirical counterpart of VUS(s) is the three-sample U-statistic
$$ \widehat{\mathrm{VUS}}_n(s)= \frac{1}{n_1n_2n_3}\sum_{1\leq i, j,k\leq n} h_s(X_i,X_j,X_k) \cdot\mathbb{I}\{Y_i=1, Y_j=2, Y_k=3\}, $$
with kernel given by for any \((x_{1},x_{2},x_{3})\in\mathcal{X}^{3}\). The computational complexity of empirical VUS calculation is investigated in Waegeman et al. (2008a).

The theoretical analysis shall rely on concentration properties of U-processes in order to control the deviation between the empirical and theoretical versions of the VUS criterion uniformly over the class \(\mathcal{S}_{1}\). Such an analysis was performed in the bipartite case in Clémençon et al. (2008) and we expect that it can be extended in the K-partite case. In contrast, algorithmic aspects of the issue of maximizing the empirical VUS criterion (or a concave surrogate) are much less straightforward and the question of extending optimization strategies such as those introduced in Clémençon and Vayatis (2009b) or Clémençon and Vayatis (2010) requires, for instance, significant methodological progress.

5.3.2 Plug-in scoring rule

As shown by Proposition 1, when Assumption 1 is fulfilled, the regression function η is an optimal scoring function. The plug-in approach consists of estimating the latter and use the resulting estimate as a scoring rule. For instance, one may estimate the posterior probabilities (η 1(x),…,η K (x)) by an empirical counterpart \((\widehat{\eta}_{1}(x),\ldots,\widehat{\eta}_{K}(x))\) based on the training data and consider the ordering on ℝ d induced by the estimator \(\widehat{\eta}(x)=\sum_{k=1}^{K} k \widehat{\eta}_{k}(x)\). We refer to Clémençon and Vayatis (2009a) and Clémençon and Robbiano (2011) for preliminary theoretical results based on this strategy in the bipartite context and Audibert and Tsybakov (2007) for an account of the plug-in approach in binary classification. It is expected that an accurate estimate of η(x) will define a ranking rule similar to the optimal one, with nearly maximal VUS. As an illustration of this approach, the next result relates the deficit of VUS of a scoring function \(\widehat{\eta}\) to its L 1(μ)-error as an estimate of η. We assume for simplicity that all class-conditional distributions have the same support.

Proposition 13

Suppose that Assumption 1 is fulfilled. Let \(\widehat {\eta}\) be an approximant of η. Assume that both the random variables η(X) and \(\widehat{\eta}(X)\) are continuous. We have:
$$\mathrm{VUS}^*-\mathrm{VUS}(\widehat{\eta})\leq\frac {p_{1}+p_{3}}{p_{1}p_{2}p_{3}}\cdot\mathbb{E}\bigl[\bigl\vert \eta(X)-\widehat{\eta}(X)\bigr\vert\bigr]. $$

This result reveals that a L 1(μ)-consistent estimator, i.e. an estimator \(\widehat{\eta}_{n}\) such that \(\mathbb {E}[|\eta (X)-\widehat {\eta}_{n}(X)|]\) converges to zero in probability as n→∞, yields a VUS-consistent ranking procedure. However, from a practical perspective, such procedures should be avoided when dealing with high-dimensional data, since they are obviously confronted to the curse of dimensionality.

5.4 Connections with regression estimation and ordinal regression

Whereas standard multi-class classification ignores the possible ordinal structure of the output space, ordinal regression takes the latter into account by penalizing more and more the error of a classifier candidate C on an example (X,Y) as |C(X)−Y| increases. In general, the loss function chosen is of the form ψ(c,y)=Ψ(|cy|), (c,y)∈{1,…,K}2, where Ψ:{0,…,K−1}→ℝ+ is some nondecreasing mapping. The most commonly used choice is Ψ(u)=u, corresponding to the risk \(L(C)=\mathbb{E}[\vert C(X)-Y \vert]\), referred to as the expected ordinal regression error sometimes, cf. Agarwal (2008). In this case, it is shown that the optimal classifier can be built by thresholding the regression function at specific levels \(t_{0}=0<t^{*}_{1}<\cdots<t^{*}_{K-1}<1=t_{K}\), that it so say it is of the form \(C^{*}(x)=\sum_{k=1}^{K}k\cdot\mathbb{I}\{ t^{*}_{k-1}\leq\eta(x)<t^{*}_{k} \}\) when assuming that \(\eta(X)=\mathbb {E}[Y\mid X]\) is a continuous r.v. for simplicity. Based on this observation, a popular approach to ordinal regression lies in estimating first the regression function η by an empirical counterpart \(\widehat{\eta}\) (through minimization of an estimate of \(R(f)=\mathbb{E}[( Y-f(X))^{2}]\) over a specific class \(\mathcal{F}\) of function candidates f, in general) and choosing next a collection t of thresholds t 0=0<t 1<⋯<t K−1<1=t K in order to minimize a statistical version of L(C t ) where \(C_{\mathbf {t}}(x)=\sum_{k=1}^{K}k\cdot\mathbb{I}\{ t_{k-1}\leq\widehat{\eta }(x)<t_{k} \}\). Such procedures are sometimes termed regression-based algorithms, see Agarwal (2008). One may refer to Kramer et al. (2001) in the case of regression trees for instance.

6 Illustrative numerical experiments

It is the purpose of this section to illustrate the approach described above by numerical results and provide some empirical evidence for its efficacy. Since our goal is here to show that, beyond its theoretical validity, the Kendall aggregation approach to multi-class ranking actually works in practice, rather than to provide a detailed empirical study of its performance on benchmark artificial/real datasets compared to that of possible competitors (this will be the subject of a forthcoming paper), in the subsequent experimental analysis we have considered two simple data generative models, for which one may easily check Assumption 1 and compute the optimal ROC surface (as well as the optimum value VUS), which the results obtained must be compared to. The first example involves mixtures of Gaussian distributions, while the second one is based on mixtures of uniform distributions, the target ROC surface being piecewise linear in the latter case (cf. assertion 4 in Proposition 14). Here, the artificial data simulated are split into a training sample and a test sample, used for plotting the “test ROC surfaces”.

The learning algorithm used for solving the bipartite ranking subproblems at the first stage of the procedure is the TreeRank procedure based on locally weighted versions of the CART method (with axis parallel splits), see Clémençon et al. (2011a) for a detailed description of the algorithm (as well as Clémençon and Vayatis 2009b for rigorous statistical foundations of this method). Precisely, we used a package for R statistical software (see implementing TreeRank (with the “default” parameters: minsplit = (size of training sample)/20, maxdepth = 10, mincrit = 0), available at, see Baskiotis et al. (2010). The scoring rules produced at stage 1 are thus (tree-structured and) piecewise constant, making the aggregating procedure described in Sect. 3.2 quite feasible. Indeed, if s 1,…,s M are scoring functions that are all constant on the cells of a finite partition \(\mathcal{P}\) of the input space \(\mathcal{X}\), one easily see that the infimum \(\inf_{s\in\mathcal{S}_{0}}\sum_{m=1}^{M}d_{\tau_{\mu }}(s,s_{m})\) reduces to a minimum over a finite collection of scoring functions that are also constant on \(\mathcal{P}\)’s cells and is thus attained. As underlined in Sect. 3.2, when the number of cells is large, median computation may become practically unfeasible and the use of a meta-heuristic can be then considered for approximation purpose (simulated annealing, tabu search, etc.), here the ranking obtained by taking the mean ranks over the K−1 rankings of the test data has been improved in the Kendall consensus sense by means of a standard simulated annealing technique.

For comparison purpose, we have also implemented two ranking algorithms, RankBoost (when aggregating 30 stumps, see Rudin et al. 2005) and SVMRank (with linear and Gaussian kernels with respective parameters C=20 and (C,γ)=(0.01), see Herbrich et al. 2000), using the SVM-light implementation available at We have also used the RankRLS method (, see Pahikkala et al. 2007) that implements a regularized least square algorithm with linear kernel (“bias=1”) and with Gaussian kernel (γ=0.01), selection of the intercept on a grid being performed through a leave-one-out procedure. For completeness, the Kendall aggregation procedure has also been implemented with RankBoost for solving the bipartite subproblems.

First example (mixtures of Gaussian distributions)

Consider a q-dimensional Gaussian random vector Z, drawn as \(\mathcal{N}(\mu ,\varGamma)\), and a Borelian set C⊂ℝ q weighted by \(\mathcal {N}(\mu ,\varGamma)\). We denote by \(\mathcal{N}_{C}(\mu,\varGamma)\) the conditional distribution of Z given ZC. Equipped with this notation, we can write the class distributions used in this example as: When p 1=p 2=p 3=1/3, the regression function is then an increasing transform of (x 1,x 2)∈[0,1]2x 1+x 2, it is given by:
$$\eta(x) =\frac{2.79\cdot e^{-(x_{1}+x_{2})^{2}}+2\cdot1.37\cdot e^{-(x_{1}+x_{2}-1)^{2}}+3\cdot2.79\cdot e^{-(x_{1}+x_{2}-2)^{2}}}{2.79\cdot e^{-(x_{1}+x_{2})^{2}}+1.37\cdot \exp^{-(x_{1}+x_{2}-1)^{2}}+2.79\cdot e^{-(x_{1}+x_{2}-2)^{2}}}. $$
The simulated dataset is plotted in Fig. 3a, while some level sets of the regression function are represented in Fig. 3b. We have drawn 50 training samples of size n=3000 and a test sample of size 3000. Using TreeRank, we learn 3 bipartite ranking rules: s (1)(x) based on data with labels “1” and “2”, s (2)(x) based on data with labels “2” and “3” and s (3)(x) based on data with labels “1” and “3”. Finally, s (1) and s (2) are aggregated through the procedure described in Sect. 3.2, yielding the score called “TreeRank Agg” in Table 1. We also used each scoring function separately to rank the test data and compute a test estimate of the VUS (“TreeRank 1v2”, “2v3”, “1v3”). The scoring function produced by RankBoost is referred to as “RankBoostVUS”, while that obtained by Kendall aggregation based on (a bipartite implementation of) RankBoost is called “RankBoost Agg”. The scoring rule computed through SVMrank (respectively, through RankRLS) based on a linear and a Gaussian kernels are respectively called “SVMrank lin” and “SVMrank gauss” (respectively, “RLScore lin” and “RLScore gauss”). Averages (\(\overline{\mathrm{VUS}}\)) over the 50 training samples have been next computed, as well as standard deviations \(\widehat{\sigma}\), they are given in Table 1 with the results of the earlier described algorithms. For comparison purpose, some level sets of the TreeRank scoring functions learnt from the first training sample are displayed in Fig. 4.
Fig. 3

First example—mixture of Gaussian distributions

Fig. 4

Levels sets of the scoring functions “TreeRank 1v2”, “TreeRank 2v3”, “TreeRank 1v3” and “TreeRank Agg” in a top-down left-right manner

Table 1

Comparison of the VUS: “Gaussian” experiment—VUS=0.4369


\(\overline{\mathrm{VUS}} (\widehat{\sigma})\)

TreeRank 1v2

0.3703 (±0.0102)

TreeRank 2v3

0.3728 (±0.0104)

TreeRank 1v3

0.3972 (±0.0053)

TreeRank Agg

0.4118 (±0.0054)


0.4281 (±0.0024)

RankBoost Agg

0.4305 (±0.0019)

SVMrank lin

0.4367 (±0.0003)

SVMrank gauss

0.4363 (±0.0009)

RLScore lin

0.4368 (±0.0003)

RLScore gauss

0.4366 (±0.0006)

Second example (mixtures of uniform distributions)

The artificial data sample used in this second example is represented in Fig. 5a and has been generated as follows. The unit square \(\mathcal{X}= [0,1]^{2}\) is split into 9 squares of equal size and we defined next the scoring function s as the function constant on each of these squares depicted by Fig. 5b). We then chose the uniform distribution over the unit square as marginal distribution of X and took \(\phi_{1,2}(x)= s_{1,2}^{*}(x)/1.3\) and \(\phi_{2,3}=1.3\times s_{2,3}^{*}(x)\). As \(s_{1,2}^{*}\) and \(s_{2,3}^{*}\) are non-decreasing functions of s (see Table 2): ϕ 2,1 and ϕ 3,2 are thus non-decreasing functions of s , by virtue of Theorem 1, the class distributions check the monotonicity assumption 1. Computation of the η i ’s on each part of \(\mathcal{X}\) is then straightforward, see Table 2.
Fig. 5

Second example—mixtures of uniform distributions

Table 2

Values of the η k ’s on each of the nine subsquare of [0,1]2, cf. Fig. 5b




η 1

η 2

η 3























































Here 50 training samples of size n=9000 plus a test sample of size 9000 have been generated. The performance results are reported in Table 3. For comparison purpose, some level sets of the scoring functions learned on the first training sample for each method are represented in Fig. 6.
Fig. 6

Levels sets of the scoring functions “TreeRank Agg”, “SVMrank lin”, “RLScore lin”, “RLScore gauss”, “SVMrank gauss”, “RankBoostVUS”, “RankBoost Agg”

Table 3

Comparison of the VUS: “uniform” experiment—VUS=0.3855



TreeRank 1v2

0.3681 (±0.0060)

TreeRank 2v3

0.3611 (±0.0056)

TreeRank 1v3

0.3774 (±0.0037)

TreeRank Agg

0.3818 (±0.0027)


0.3681 (±0.0013)

RankBoost Agg

0.3687 (±0.0013)

SVMrank lin

0.3557 (±0.0008)

SVMrank gauss

0.3734 (±0.0008)

RLScore lin

0.3554 (±0.0005)

RLScore gauss

0.3742 (±0.0007)

Cardiotocography data

We also illustrate the methodology promoted in this paper by implementing it on a real data set, the Cardiotocography Data Set considered in Frank and Asuncion (2010) namely. The data have been collected as follows: 2126 fetal cardiotocograms (CTG’s in abbreviated form) have been automatically processed and the respective diagnostic features measured. The CTG’s have been next analyzed by three expert obstetricians and a consensus ordinal label has been then assigned to each of them, depending on the degree of anomaly observed: 1 for “normal”, 2 for “suspect” and 3 for “pathologic”.

We have split the data set into a training sample \(\mathcal{D}_{e}\) and a test sample \(\mathcal{D}_{t}\) of same sizes: scoring functions have been built based on the sample \(\mathcal{D}_{e}\) and next tested on the sample \(\mathcal{D}_{t}\) (i.e. we have computed the empirical versions of the ROC and VUS criteria based on \(\mathcal{D}_{t}\)). In this experiment, parameters have been selected by cross-validation: the scoring rule RankBoostVUS is based on 300 stumps and the bipartite rules produced by RankBoost are based on 100 stumps, the intercept involved in SVM ranklin is C=(0.001), while SVMrank gauss, RLScore lin and RLScore gauss have been obtained with the respective parameters (C,γ)=(0.001,0.0001), bias=1 and (bias,γ)=(1,0.001). Performance results are reported in Table 4 and the ROC surfaces test are plotted in Fig. 7.
Fig. 7

ROC surfaces “test” of the scoring functions bipartite “TreeRank”, “TreeRank Agg”, “SVMrank lin”, “RLScore lin”, “RLScore gauss”, “SVMrank gauss”, “RankBoostVUS”, “RankBoost Agg”

Table 4

Comparison of the VUS test—“Cardiotocography” experiment


VUS test

TreeRank 1v2


TreeRank 2v3


TreeRank 1v3


TreeRank Agg




RankBoost Agg


SVMrank lin


SVMrank gauss


RLScore lin


RLScore gauss



We observe that, in each of these experiments, Kendall aggregation clearly improves ranking accuracy, when measured in terms of VUS. In addition, looking at the standard deviation, we see that the aggregated scoring function is more stable. In terms of level sets, Kendall aggregation yielded more complex subsets and thus sharper results. Notice additionally that, as in the “Gaussian” experiment the level sets are linear, it is not surprising that the kernel methods outperform the tree-based ones in this situation. In contrast, for the “uniform” experiment, the tree-based methods performed much better than the others, the performance of TreeRank Agg is nearly optimal. Looking at the level sets (see Fig. 6), they seem to recover well their geometric structure. Observe also that Kendall aggregation of (bipartite) scoring functions produced by RankBoost has always lead to (slightly) better results than those obtained by a direct use of RankBoost on the 3-class population, with a computation time smaller by a factor 10 however. Finally, notice that, on the Cardiotocography data set, the Kendall aggregation approach based on RankBoost is the method that produced the scoring function with largest VUS test among the algorithms candidates. In particular, it provides the best discrimination for the bipartite subproblem “1 vs 2”, the most difficult to solve apparently, in view of the ROC surfaces plotted in Fig. 7.

Psychometric data

For completeness, we also carried out experiments based on four datasets with ordinal labels (ERA, ESL, LEV and SWD namely), considered in David (2008) (due to the rarity of such data, regression datasets are sometimes transformed into ordinal datasets to serve as benchmarkk, see Fürnkranz et al. 2009 and Huhn and Hüllermeier 2008). Because of the wide disparity between certain class sizes, data with certain labels are ignored (in the ESL dataset for instance, the class “1” counts only two observations). On top of the ranking bipartite algorithms used previously, we also implemented the aggregation method based on the algorithm Ranking Forest with 50 trees and a linear SVM with constant C=50 as LeafRank procedure (see Clémençon et al. 2011b for more details), this is referred to as “TreeRankF Agg” in the tables. For each experiment, in addition to the VUS, we computed alternative ranking performance statistics over five replications of a five-fold cross validation: the C-index (see Fürnkranz et al. 2009; Herbrich et al. 2000) and the Jonckheere-Terpstra statistic (JPstat in abbreviated form, see Hand and Till 2001 and Higgins 2004). The results are reported in the Tables 5, 6, 7 and 8 (standard deviations are not indicated, their order of magnitude, 10−3 namely, being negligible).
Table 5

Comparison of the VUS test—“ERA” experiment


class 1–7

class 1–9

VUS test



VUS test



TreeRank Agg







TreeRankF Agg














RankBoost Agg







SVMrank lin







SVMrank gauss







RLScore lin







RLScore gauss







Table 6

Comparison of the VUS test—“ESL” experiment (class 3–7)


VUS test



TreeRank Agg




TreeRankF Agg








RankBoost Agg




SVMrank lin




SVMrank gauss




RLScore lin




RLScore gauss




Table 7

Comparison of the VUS test—“LEV” experiment


class 0–3

class 0–4

VUS test



VUS test



TreeRank Agg







TreeRankF Agg














RankBoost Agg







SVMrank lin







SVMrank gauss







RLScore lin







RLScore gauss







Table 8

Comparison of the VUS test—“SWD” experiment


class 2–5

class 3–5

VUS test



VUS test



TreeRank Agg







TreeRankF Agg














RankBoost Agg







SVMrank lin







SVMrank gauss







RLScore lin







RLScore gauss







We highlight the fact that the results we obtained with the approach promoted in this paper are quite comparable to those in Fürnkranz et al. (2009), they find a C-index of 0.7418 and a JPstat of 0.7265 in the case of ERA with nine classes as well as a C-index of 0.8660 and a JPstat of 0.8757 in the case of LEV with five classes. Contrary to the C-index and the JPstat for which all the values obtained are very close to each other, the VUS seems to reveal more contrast in the ranking performance. For instance, the aggregation procedure based on the TreeRank algorithm clearly outperforms the other competitors when considering the SWD dataset with classes 2–5, assessing the relevance of this approach in a situation where the dimension of the input space is not small (10 namely) and the population very skewed (the size of class “2” is very small compared to that of the others). Observe also that, in the other cases, the aggregation technique implemented using Ranking Forest has performance very similar to the state-of-the-art: sometimes not considerably below (cf. ERA with 7 classes, ERA and LEV) sometimes slightly better (cf. ESL and SWD with 3 classes).

These empirical results only aim at illustrating the Kendall aggregation approach for K-partite ranking, the limited goal pursued here being to show how aggregation helps to improve results. Beyond the theoretical validity framework sketched in Sect. 3, since a variety of bipartite ranking algorithms have been proposed in the literature and dedicated libraries are readily available, one of the main advantages of the Kendall aggregation approach lies in the fact that it is very easy to implement, when applied to bipartite rules that are not too complex, so that the (approximate) median computation is feasible, see Sect. 3.2. A more complete and detailed empirical analysis of the merits and limitations of this procedure is currently the subject of ongoing work, where comparisons with competitors are carried out and computational issues are investigated at length, provided that more real datasets with ordinal labels can be obtained.

7 Conclusion

In this article, we have presented theoretical work on ranking data with ordinal labels. In the first part of the paper, the issue of optimality has been tackled. We have proposed a monotonicity likelihood ratio condition that guarantees the existence and unicity of an “optimal” preorder on the input space, in the sense that it is optimal for any bipartite ranking subproblem, considering all possible pairs of labels. In particular, the regression function is proved to define an optimal ranking rule in this setting, highlighting the connection between K-partite ranking and ordinal regression. The second part is dedicated to describe a specific method for decomposing the multi-class ranking problem into a series of bipartite ranking tasks, as proposed in Fürnkranz et al. (2009). We have introduced a specific notion of median scoring function based on the (probabilistic) Kendall τ distance. We have next shown that the notion of ROC manifold/surface and its summary, the volume under the ROC surface (VUS), then provide quantitative criteria for evaluating ranking accuracy in the ordinal setup: under the afore mentioned monotonicity likelihood ratio condition, scoring functions whose ROC surface is as high as possible everywhere exactly coincide with those forming the optimal set (i.e. the set of scoring functions that are optimal for all bipartite subproblems, defined with no reference to the notions of ROC surface and VUS). Conversely, we have proved that the existence of a scoring function with such a dominating ROC surface implies that the monotonicity likelihood ratio condition is fulfilled. It is shown that the aggregation procedure leads to a consistent ranking rule, when applied to scoring functions that are, each, consistent for the bipartite ranking subproblem related to a specific pair of consecutive class distributions. This approach allows for extending the use of ranking algorithms originally designed for the bipartite situation to the ordinal multi-class context. It is illustrated by three numerical examples. Further experiments, based on more real datasets in particular, will be carried out in the future in order to determine precisely the situations in which this method is competitive, compared to alternative ranking techniques in the ordinal multi-class setup. In this respect, we underline that, so far, very few practical algorithms tailored for ROC graph optimization have been proposed in the literature. Whereas, as shown at length in Clémençon and Vayatis (2009b) and Clémençon et al. (2011a), partitioning techniques for AUC maximization, in the spirit of the CART method for classification, can be implemented in a very simple manner, by solving recursively cost-sensitive classification problems (with a local cost, depending on the data lying in the cell to be split), recursive VUS maximization remains a challenging issue, for which no simple interpretation is currently available. Hence, the number of possible strategies for direct optimization of the ranking criterion in the K-partite situation contrasts with that in the bipartite context and strongly advocates, for the moment, for considering techniques that transform multi-class ranking into a series of bipartite tasks, such as the method analyzed in this article.


  1. Agarwal, S. (2008). Generalization bounds for some ordinal regression algorithms. In Proceedings of the 19th international conference on algorithmic learning theory, ALT ’08 (pp. 7–21). Berlin: Springer. CrossRefGoogle Scholar
  2. Agarwal, S., Graepel, T., Herbrich, R., Har-Peled, S., & Roth, D. (2005). Generalization bounds for the area under the ROC curve. Journal of Machine Learning Research, 6, 393–425. MathSciNetGoogle Scholar
  3. Allwein, E., Schapire, R., & Singer, Y. (2001). Reducing multiclass to binary: a unifying approach for margin classifiers. Journal of Machine Learning Research, 1, 113–141. MathSciNetzbMATHGoogle Scholar
  4. Audibert, J., & Tsybakov, A. (2007). Fast learning rates for plug-in classifiers. The Annals of Statistics, 35, 608–633. MathSciNetzbMATHCrossRefGoogle Scholar
  5. Barthélemy, J., Guénoche, A., & Hudry, O. (1989). Median linear orders: heuristics and a branch and bound algorithm. European Journal of Operational Research, 42(3), 313–325. MathSciNetzbMATHCrossRefGoogle Scholar
  6. Baskiotis, N., Clémençon, S., Depecker, M., & Vayatis, N. (2010). Treerank: an R package for bipartite ranking. In Proceedings of SMDTA 2010—stochastic modeling techniques and data analysis international conference. Google Scholar
  7. Beygelzimer, A., Dani, V., Hayes, T., Langford, J., & Zadrozny, B. (2005a). Error limiting reductions between classification tasks. In Machine learning, proceedings of the twenty-second international conference (ICML 2005) (pp. 49–56). Google Scholar
  8. Beygelzimer, A., Langford, J., & Zadrozny, B. (2005b). Weighted one against all. In Proceedings of the 20th national conference on artificial intelligence, AAAI ’05 (Vol. 2, pp. 720–725). Google Scholar
  9. Charon, I., & Hudry, O. (1998). Lamarckian genetic algorithms applied to the aggregation of preferences. Annals of Operations Research, 80, 281–297. MathSciNetzbMATHCrossRefGoogle Scholar
  10. Clémençon, S., & Robbiano, S. (2011). Minimax learning rates for bipartite ranking and plug-in rules. In Proceedings of the 28th international conference on machine learning, ICML’11 (pp. 441–448). Google Scholar
  11. Clémençon, S., & Vayatis, N. (2009a). On partitioning rules for bipartite ranking. Journal of Machine Learning Research, 5, 97–104. Google Scholar
  12. Clémençon, S., & Vayatis, N. (2009b). Tree-based ranking methods. IEEE Transactions on Information Theory, 55(9), 4316–4336. CrossRefGoogle Scholar
  13. Clémençon, S., & Vayatis, N. (2009c). Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm. In Proceedings of the 20th international conference on algorithmic learning theory, ALT ’09 (pp. 216–231). CrossRefGoogle Scholar
  14. Clémençon, S., & Vayatis, N. (2010). Overlaying classifiers: a practical approach to optimal scoring. Constructive Approximation, 32(3), 619–648. MathSciNetzbMATHCrossRefGoogle Scholar
  15. Clémençon, S., Lugosi, G., & Vayatis, N. (2008). Ranking and empirical risk minimization of U-statistics. The Annals of Statistics, 36(2), 844–874. MathSciNetzbMATHCrossRefGoogle Scholar
  16. Clémençon, S., Depecker, M., & Vayatis, N. (2011a). Adaptive partitioning schemes for bipartite ranking. Machine Learning, 43(1), 31–69. CrossRefGoogle Scholar
  17. Clémençon, S., Depecker, M., & Vayatis, N. (2011b). Avancées récentes dans le domaine de l’apprentissage statistique d’ordonnancements. Revue d’Intelligence Artificielle, 25(3), 345–368. CrossRefGoogle Scholar
  18. David, A. B. (2008). Ordinal real-world data sets repository. Google Scholar
  19. Debnath, R., Takahide, N., & Takahashi, H. (2004). A decision based one-against-one method for multi-class support vector machine. Pattern Analysis and Its Applications, 7(2), 164–175. MathSciNetGoogle Scholar
  20. Dietterich, T. G., & Bakiri, G. (1995). Solving multiclass learning problems via error-correcting output codes. The Journal of Artificial Intelligence Research, 2, 263–286. zbMATHGoogle Scholar
  21. Dreiseitl, S., Ohno-Machado, L., & Binder, M. (2000). Comparing three-class diagnostic tests by three-way ROC analysis. Medical Decision Making, 20, 323–331. CrossRefGoogle Scholar
  22. Edwards, D., Metz, C., & Kupinski, M. (2005). The hypervolume under the ROC hypersurface of ‘near-guessing’ and ‘near-perfect’ observers in n-class classification tasks. IEEE Transactions on Medical Imaging, 24(3), 293–299. CrossRefGoogle Scholar
  23. Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., & Vee, E. (2004). Comparing and aggregating rankings with ties. In Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, PODS ’04 (pp. 47–58). CrossRefGoogle Scholar
  24. Ferri, C., Hernández-Orallo, J., & Salido, M. (2003). Volume under the ROC surface for multi-class problems. In Proceedings of 14th European conference on machine learning (pp. 108–120). Google Scholar
  25. Fieldsend, J., & Everson, R. (2005). Formulation and comparison of multi-class ROC surfaces. In Proceedings of the ICML 2005 workshop on ROC analysis in machine learning (pp. 41–48). Google Scholar
  26. Fieldsend, J., & Everson, R. (2006). Multi-class ROC analysis from a multi-objective optimisation perspective. Pattern Recognition Letters, 27, 918–927. CrossRefGoogle Scholar
  27. Flach, P. (2004). Tutorial: “the many faces of ROC analysis in machine learning”. Part III (Technical report). International conference on machine learning 2004. Google Scholar
  28. Frank, A., & Asuncion, A. (2010). UCI machine learning repository. Google Scholar
  29. Freund, Y., Iyer, R. D., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933–969. MathSciNetGoogle Scholar
  30. Fürnkranz, J. (2002). Round robin classification. Journal of Machine Learning Research, 2, 721–747. zbMATHGoogle Scholar
  31. Fürnkranz, J., Hüllermeier, E., & Vanderlooy, S. (2009). Binary decomposition methods for multipartite ranking. In Proceedings of the European conference on machine learning and knowledge discovery in databases: Part I, ECML PKDD ’09 (pp. 359–374). CrossRefGoogle Scholar
  32. Hand, D., & Till, R. (2001). A simple generalisation of the area under the ROC curve for multiple class classification problems. Machine Learning, 45(2), 171–186. zbMATHCrossRefGoogle Scholar
  33. Hastie, T., & Tibshirani, R. (1998). Classification by pairwise coupling. The Annals of Statistics, 26(2), 451–471. MathSciNetzbMATHCrossRefGoogle Scholar
  34. Herbrich, R., Graepel, T., & Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. In Advances in large margin classifiers (pp. 115–132). Cambridge: MIT Press. Google Scholar
  35. Higgins, J. (2004). Introduction to modern nonparametric statistics. N. Scituate: Duxbury Press. Google Scholar
  36. Hudry, O. (2008). NP-hardness results for the aggregation of linear orders into median orders. Annals of Operations Research, 163, 63–88. MathSciNetzbMATHCrossRefGoogle Scholar
  37. Huhn, J., & Hüllermeier, E. (2008). Is an ordinal class structure useful in classifier learning? International Journal of Data Mining, Modelling and Management, 1(1), 45–67. CrossRefGoogle Scholar
  38. Kramer, S., Pfahringer, B., Widmer, G., & Groeve, M. D. (2001). Prediction of ordinal regression trees. Fundamenta Informaticae, 47, 1001–1013. Google Scholar
  39. Laguna, M., Marti, R., & Campos, V. (1999). Intensification and diversification with elite tabu search solutions for the linear ordering problem. Computers and Operations Research, 26(12), 1217–1230. zbMATHCrossRefGoogle Scholar
  40. Landgrebe, T., & Duin, R. (2006). A simplified extension of the area under the ROC to the multiclass domain. In Seventeenth annual symposium of the pattern recognition association of South Africa (pp. 241–245). Google Scholar
  41. Lebanon, G., & Lafferty, J. (2002). Conditional models on the ranking poset. In Advances in neural information processing systems (Vol. 15, pp. 415–422). Google Scholar
  42. Lehmann, E., & Romano, J. P. (2005). Testing statistical hypotheses. Berlin: Springer. zbMATHGoogle Scholar
  43. Li, J., & Zhou, X. (2009). Nonparametric and semiparametric estimation of the three way receiver operating characteristic surface. Journal of Statistical Planning and Inference, 139, 4133–4142. MathSciNetzbMATHCrossRefGoogle Scholar
  44. Mandhani, B., & Meila, M. (2009). Tractable search for learning exponential models of rankings. Journal of Machine Learning Research. Proceedings Track, 5, 392–399. Google Scholar
  45. Meila, M., Phadnis, K., Patterson, A., & Bilmes, J. (2007). Consensus ranking under the exponential model. In Proceedings of the twenty-third conference annual conference on uncertainty in artificial intelligence (UAI-07) (pp. 285–294). Google Scholar
  46. Mossman, D. (1999). Three-way ROCs. Medical Decision Making, 19(1), 78–89. CrossRefGoogle Scholar
  47. Nakas, C., & Yiannoutsos, C. (2004). Ordered multiple-class ROC analysis with continuous measurements. Statistics in Medicine, 23(22), 3437–3449. CrossRefGoogle Scholar
  48. Pahikkala, T., Tsivtsivadze, E., Airola, A., Boberg, J., & Salakoski, T. (2007). Learning to rank with pairwise regularized least-squares. In Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval (pp. 27–33). Google Scholar
  49. Pepe, M. (2003). Statistical evaluation of medical tests for classification and prediction. Oxford: Oxford University Press. zbMATHGoogle Scholar
  50. Rajaram, S., & Agarwal, S. (2005). Generalization bounds for k-partite ranking. In NIPS workshop on learning to rank. Google Scholar
  51. Robbiano, S. (2010). Note on confidence regions for the ROC surface (Technical report). Telecom ParisTech. Google Scholar
  52. Rudin, C., Cortes, C., Mohri, M., & Schapire, R. E. (2005). Margin-based ranking and boosting meet in the middle. In Proceedings of the 18th annual conference on learning theory, COLT’05 (pp. 63–78). Berlin: Springer. Google Scholar
  53. Scurfield, B. (1996). Multiple-event forced-choice tasks in the theory of signal detectability. Journal of Mathematical Psychology, 40, 253–269. zbMATHCrossRefGoogle Scholar
  54. Tsybakov, A. (2004). Optimal aggregation of classifiers in statistical learning. The Annals of Statistics, 32(1), 135–166. MathSciNetzbMATHCrossRefGoogle Scholar
  55. Vapnik, V. (1999). An overview of statistical learning theory. IEEE Transactions on Neural Networks, 10(5), 988–999. CrossRefGoogle Scholar
  56. Venkatesan, G., & Amit, S. (1999). Multiclass learning, boosting, and error-correcting codes. In Proceedings of the twelfth annual conference on computational learning theory, COLT’99 (pp. 145–155). Google Scholar
  57. Waegeman, W., & Baets, B. D. (2011). On the era ranking representability of pairwise bipartite ranking functions. Artificial Intelligence, 175, 1223–1250. MathSciNetzbMATHCrossRefGoogle Scholar
  58. Waegeman, W., Baets, B. D., & Boullart, L. (2008a). On the scalability of ordered multi-class ROC analysis. Computational Statistics and Data Analysis, 52, 3371–3388. MathSciNetzbMATHCrossRefGoogle Scholar
  59. Waegeman, W., Baets, B. D., & Boullart, L. (2008b). ROC analysis in ordinal regression learning. Pattern Recognition Letters, 29, 1–9. CrossRefGoogle Scholar
  60. Wakabayashi, Y. (1998). The complexity of computing medians of relations. Resenhas, 3(3), 323–349. MathSciNetzbMATHGoogle Scholar

Copyright information

© The Author(s) 2012

Authors and Affiliations

  • Stéphan Clémençon
    • 1
  • Sylvain Robbiano
    • 1
    Email author
  • Nicolas Vayatis
    • 2
  1. 1.LTCI UMR Telecom ParisTech/CNRS No. 5141Telecom ParisTechParis cedex 13France
  2. 2.CMLA UMR CNRS No. 8536ENS Cachan & UniverSudCahan cedexFrance

Personalised recommendations