Study Vault Search notes, aliases and full text
Graph
ConceptDBISAI-written · not yet proofread

Discounted Cumulative Gain

Also DCG · nDCG · DCG and nDCG · Normalized Discounted Cumulative Gain

DCG@k = Σ_{i=1..k} rel_i / log2(i + 1) sums the graded relevances of the top k results with a logarithmic position discount; nDCG@k = DCG@k / iDCG@k normalizes it by the DCG@k of the ideal ranking.

Know these firstGround Truth

Properties#

  • Discount: the factor 1/log⁡2(i+1)1/\log_2(i+1) makes a relevant document count less the lower it is ranked; rank 1 keeps its full relevance (log⁡22=1\log_2 2 = 1). So very relevant documents ranked above only somewhat relevant ones get a bonus, which binary measures like P@k and AP cannot express.
  • CG ignores the order within the top kk; DCG does not.
  • CG and DCG are not normalized to [0,1][0, 1]; nDCG is: nDCG@k∈[0,1]\mathrm{nDCG@}k \in [0, 1], and nDCG@k=1\mathrm{nDCG@}k = 1 iff the top kk relevances equal those of the ideal ranking. Because of the normalization, nDCG values of different queries can be averaged over a benchmark.
  • DCG@k increases when a more relevant document moves to a higher position.

Example#

Sources#

Search

Type In
↑ ↓ move ↵ open ⇥ next section Ctrl↵ results page Prefix # to search text only