A COLLABORATIVE FILTERING APPROACH TO SPONSORED SEARCH

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 as well as online traffic 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. In addition to the proposed approach our experimental methodology of evaluation on live traffic is a novel contribution to the academic literature.

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

[2]  Andrei Broder,et al.  A taxonomy of web search , 2002, SIGF.

[3]  Joshua Goodman,et al.  Finding advertising keywords on web pages , 2006, WWW '06.

[4]  Berthier A. Ribeiro-Neto,et al.  Impedance coupling in content-targeted advertising , 2005, SIGIR '05.

[5]  Harry Shum,et al.  Query Dependent Ranking Using K-nearest Neighbor * , 2022 .

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

[7]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[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]  Yehuda Koren,et al.  Factorization meets the neighborhood: a multifaceted collaborative filtering model , 2008, KDD.

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

[12]  Susan T. Dumais,et al.  Improving Web Search Ranking by Incorporating User Behavior Information , 2019, SIGIR Forum.

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

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

[15]  Filip Radlinski,et al.  Query chains: learning to rank from implicit feedback , 2005, KDD '05.

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

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

[18]  Kenneth Ward Church,et al.  Query suggestion using hitting time , 2008, CIKM '08.

[19]  Hema Raghavan.  Evaluating Vector-Space and Probabilistic Models for Query to Ad Matching , 2008 .

[20]  Ron Kohavi,et al.  Practical guide to controlled experiments on the web: listen to your customers not to the hippo , 2007, KDD '07.

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

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

[23]  David M. Pennock,et al.  Categories and Subject Descriptors , 2001 .

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

[25]  Benjamin Piwowarski,et al.  A user browsing model to predict search engine click data from past observations. , 2008, SIGIR '08.

[26]  Thorsten Joachims,et al.  Accurately interpreting clickthrough data as implicit feedback , 2005, SIGIR '05.

[27]  Bernard J. Jansen,et al.  Examining Searcher Perceptions of and Interactions with Sponsored Results , 2005 .

[28]  David Hawking,et al.  Overview of the TREC 2004 Web Track , 2004, TREC.

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

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

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

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

[33]  Vassilis Plachouras,et al.  A noisy-channel approach to contextual advertising , 2007, ADKDD '07.

[34]  Vassilis Plachouras,et al.  Online learning from click data for sponsored search , 2008, WWW.

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