%0 Conference Paper %1 chapelle2009expected %A Chapelle, Olivier %A Metlzer, Donald %A Zhang, Ya %A Grinspan, Pierre %B Proceedings of the 18th ACM conference on Information and knowledge management %C New York, NY, USA %D 2009 %I ACM %K err expected learning rank ranking reciprocal %P 621--630 %R 10.1145/1645953.1646033 %T Expected reciprocal rank for graded relevance %U http://doi.acm.org/10.1145/1645953.1646033 %X While numerous metrics for information retrieval are available in the case of binary relevance, there is only one commonly used metric for graded relevance, namely the Discounted Cumulative Gain (DCG). A drawback of DCG is its additive nature and the underlying independence assumption: a document in a given position has always the same gain and discount independently of the documents shown above it. Inspired by the "cascade" user model, we present a new editorial metric for graded relevance which overcomes this difficulty and implicitly discounts documents which are shown below very relevant documents. More precisely, this new metric is defined as the expected reciprocal length of time that the user will take to find a relevant document. This can be seen as an extension of the classical reciprocal rank to the graded relevance case and we call this metric Expected Reciprocal Rank (ERR). We conduct an extensive evaluation on the query logs of a commercial search engine and show that ERR correlates better with clicks metrics than other editorial metrics. %@ 978-1-60558-512-3

@inproceedings{chapelle2009expected, abstract = {While numerous metrics for information retrieval are available in the case of binary relevance, there is only one commonly used metric for graded relevance, namely the Discounted Cumulative Gain (DCG). A drawback of DCG is its additive nature and the underlying independence assumption: a document in a given position has always the same gain and discount independently of the documents shown above it. Inspired by the "cascade" user model, we present a new editorial metric for graded relevance which overcomes this difficulty and implicitly discounts documents which are shown below very relevant documents. More precisely, this new metric is defined as the expected reciprocal length of time that the user will take to find a relevant document. This can be seen as an extension of the classical reciprocal rank to the graded relevance case and we call this metric Expected Reciprocal Rank (ERR). We conduct an extensive evaluation on the query logs of a commercial search engine and show that ERR correlates better with clicks metrics than other editorial metrics.}, acmid = {1646033}, added-at = {2013-01-12T17:00:00.000+0100}, address = {New York, NY, USA}, author = {Chapelle, Olivier and Metlzer, Donald and Zhang, Ya and Grinspan, Pierre}, biburl = {https://www.bibsonomy.org/bibtex/23a56c5d10c5882f3c89cb2d07a16aa3e/nosebrain}, booktitle = {Proceedings of the 18th ACM conference on Information and knowledge management}, description = {Expected reciprocal rank for graded relevance}, doi = {10.1145/1645953.1646033}, interhash = {e02309ec5d399855751789bd6b6a1ca1}, intrahash = {3a56c5d10c5882f3c89cb2d07a16aa3e}, isbn = {978-1-60558-512-3}, keywords = {err expected learning rank ranking reciprocal}, location = {Hong Kong, China}, numpages = {10}, pages = {621--630}, publisher = {ACM}, series = {CIKM '09}, timestamp = {2013-01-21T14:43:44.000+0100}, title = {Expected reciprocal rank for graded relevance}, url = {http://doi.acm.org/10.1145/1645953.1646033}, year = 2009 }