A Dynamic Bayesian Network Click Model for Web Search Ranking

Presented at: 18th International World Wide Web Conference (WWW2009)

by Olivier Chapelle, Ya Zhang

Webpage: http://www2009.eprints.org/1/1/p1.pdf

As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can also provide an important source of implicit feedback and can be used as a cheap proxy for editorial labels. The main difficulty however comes from the so called position bias — urls appearing in lower positions are less likely to be clicked even if they are relevant. In this paper, we propose a Dynamic Bayesian Network which aims at providing us with unbiased estimation of the relevance from the click logs. Experiments show that the proposed click model outperforms other existing click models in predicting both click-through rate and relevance.

Keywords: Data Mining


Resource URI on the dog food server: http://data.semanticweb.org/conference/www/2009/paper/1


Explore this resource elsewhere: