1081 articles – 5291 references  [version française]
HAL: in2p3-00726760, version 1

Detailed view  Export this paper
20th European Conference on Artificial Intelligence (ECAI 2012) : Preference Learning: Problems and Applications in AI Workshop, Montpellier : France (2012)
An apple-to-apple comparison of Learning-to-rank algorithms in terms of Normalized Discounted Cumulative Gain
R. Busa-Fekete, G. Szarvas, T. Élteto, B. Kégl1, 2, 3
(2012)

The Normalized Discounted Cumulative Gain (NDCG) is a widely used evaluation metric for learning-to-rank (LTR) systems. NDCG is designed for ranking tasks with more than one relevance levels. There are many freely available, open source tools for computing the NDCG score for a ranked result list. Even though the definition of NDCG is unambiguous, the various tools can produce different scores for ranked lists with certain properties, deteriorating the empirical tests in many published papers and thereby making the comparison of empirical results published in different studies difficult to compare. In this study, first, we identify the major differences between the various publicly available NDCG evaluation tools. Second, based on a set of comparative experiments using a common benchmark dataset in LTR research and 6 different LTR algorithms, we demonstrate how these differences affect the overall performance of different algorithms and the final scores that are used to compare different systems.
1:  LAL - Laboratoire de l'Accélérateur Linéaire
2:  LRI - Laboratoire de Recherche en Informatique
3:  INRIA Saclay - Ile de France - TAO
Appstat
Computer Science/Data Structures and Algorithms
Attached file list to this document: 
PDF
07-busa-fekete.pdf(162.3 KB)