Smoothing Clickthrough Data for Web Search Ranking
yuanwei <at> iro (point) umontreal (point) ca)
Friday 17 July 2009 at 11:30 AM — jour inhabituel
Salle 3195, Pavillon André-Aisenstadt
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web search applications. Such benefits, however, are severely limited by the data sparseness problem, i.e., many queries and documents have no or very few clicks. The ranker thus cannot rely strongly on clickthrough features for document ranking. We propose two smoothing methods to expand clickthrough data: query clustering via Random Walk on click graphs and a discounting method inspired by the Good-Turing estimator. Experiments on real-world data show that the ranking models trained on smoothed clickthrough features consistently outperform those trained on unsmoothed features. This study demonstrates both the importance and the benefits of dealing with the sparseness problem in clickthrough data.
To receive weekly talk announcements, please send an e-mail to firstname.lastname@example.org. Simply write a message containing the single line 'subscribe ralli' (without the quotes).
See all the weekly talks for the year:1991 1992 1993 1994 1995 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020