Bypass rates: reducing query abandonment using negative inferences
Lists
Only you see this
Abstract
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed-documents returned higher in the ordering of the search results but skipped by the user. This approach complements the popular click-through rate analysis, and helps to draw negative inferences in the click logs. We formulate a natural objective that finds sets of results that are unlikely to be collectively bypassed by a typical user. This is closely related to the problem of reducing query abandonment. We analyze a greedy approach to optimizing this objective, and establish theoretical guarantees of its performance. We evaluate our approach on a large set of queries, and demonstrate that it compares favorably to the maximal marginal relevance approach on a number of metrics including mean average precision and mean reciprocal rank.
BibTeX
@inproceedings{sarma2008bypass,
author = {Atish Das Sarma and Sreenivas Gollapudi and Samuel Ieong},
title = {{Bypass rates: reducing query abandonment using negative inferences}},
booktitle = {ACM SIGKDD Conference on Knowledge Discovery and Data Mining},
year = {2008},
url = {https://openreview.net/forum?id=_KKnFv7Qldn8},
}Loading related content...