Optimizing nDCG Gains by Minimizing Effect of Label Inconsistency

  • Pavel Metrikov
  • Virgil Pavlu
  • Javed A. Aslam
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7814)

Abstract

We focus on nDCG choice of gains, and in particular on the fracture between large differences in exponential gains of high relevance labels and the not-so-small confusion, or inconsistency, between these labels in data. We show that better gains can be derived from data by measuring the label inconsistency, to the point that virtually indistinguishable labels correspond to equal gains. Our derived optimal gains make a better nDCG objective for training Learning to Rank algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bailey, P., Craswell, N., Soboroff, I., Thomas, P., de Vries, A.P., Yilmaz, E.: Relevance assessment: Are judges exchangeable and does it matter? In: SIGIR (2008)Google Scholar
  2. 2.
    Sakai, T.: Evaluating evaluation metrics based on the bootstrap. In: SIGIR (2006)Google Scholar
  3. 3.
    Wu, Q., Burges, C., Svore, K., Gao, J.: Ranking, boosting, and model adaptationGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Pavel Metrikov
    • 1
  • Virgil Pavlu
    • 1
  • Javed A. Aslam
    • 1
  1. 1.Northeastern UniversityBostonUSA

Personalised recommendations