LGMLMar 11, 2013

Linear NDCG and Pair-wise Loss

arXiv:1303.2417v1
Originality Synthesis-oriented
AI Analysis

This is an incremental theoretical contribution for information retrieval and ranking tasks.

The paper tackles the problem of measuring web content quality by proving that the DCG error is equivalent to a new pair-wise loss, as applied in the ECML/PKDD Discovery Challenge 2010.

Linear NDCG is used for measuring the performance of the Web content quality assessment in ECML/PKDD Discovery Challenge 2010. In this paper, we will prove that the DCG error equals a new pair-wise loss.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes