A collaborative filtering approach to ad recommendation using the query-ad click graph

Search engine logs contain a large amount of click-through data that can be leveraged as soft indicators of relevance. In this paper we address the sponsored search retrieval problem which is to find and rank relevant ads to a search query. We propose a new technique to determine the relevance of an ad document for a search query using click-through data. The method builds on a collaborative filtering approach to discover new ads related to a query using a click graph. It is implemented on a graph with several million edges and scales to larger sizes easily. The proposed method is compared to three different baselines that are state-of-the-art for a commercial search engine. Evaluations on editorial data indicate that the model discovers many new ads not retrieved by the baseline methods. The ads from the new approach are on average of better quality than the baselines.

[1]  Ioannis Antonellis,et al.  Simrank++: query rewriting through link analysis of the clickgraph (poster) , 2007, Proc. VLDB Endow..

[2]  Olfa Nasraoui,et al.  Mining search engine query logs for query recommendation , 2006, WWW '06.

[3]  Yehuda Koren,et al.  Factorization meets the neighborhood: a multifaceted collaborative filtering model , 2008, KDD.

[4]  Benjamin Rey,et al.  Generating query substitutions , 2006, WWW '06.

[5]  Gregory N. Hullender,et al.  Learning to rank using gradient descent , 2005, ICML.

[6]  Olivier Chapelle,et al.  A dynamic bayesian network click model for web search ranking , 2009, WWW '09.

[7]  Wei Vivian Zhang,et al.  Comparing Click Logs and Editorial Labels for Training Query Rewriting , 2007 .

[8]  Nick Craswell,et al.  Random walks on the click graph , 2007, SIGIR.

[9]  Filip Radlinski,et al.  Optimizing relevance and revenue in ad search: a query substitution approach , 2008, SIGIR '08.

[10]  Matthew Richardson,et al.  Predicting clicks: estimating the click-through rate for new ads , 2007, WWW '07.

[11]  Robert Legenstein,et al.  Improved neighborhood-based algorithms for large-scale recommender systems , 2008, NETFLIX '08.

[12]  Rukmini Iyer,et al.  Data-driven text features for sponsored search click prediction , 2009, KDD Workshop on Data Mining and Audience Intelligence for Advertising.

[13]  Andrei Z. Broder,et al.  Search advertising using web relevance feedback , 2008, CIKM '08.

[14]  Ariel Fuxman,et al.  Using the wisdom of the crowds for keyword generation , 2008, WWW.

[15]  Dustin Hillard,et al.  A COLLABORATIVE FILTERING APPROACH TO SPONSORED SEARCH , 2009 .

[16]  Larry P. Heck,et al.  Trada: tree based ranking function adaptation , 2008, CIKM '08.

[17]  Ji-Rong Wen,et al.  Clustering user queries of a search engine , 2001, WWW '01.

[18]  Doug Beeferman,et al.  Agglomerative clustering of a search engine query log , 2000, KDD '00.

[19]  David Heckerman,et al.  Empirical Analysis of Predictive Algorithms for Collaborative Filtering , 1998, UAI.

[20]  Thorsten Joachims,et al.  Accurately Interpreting Clickthrough Data as Implicit Feedback , 2017 .