An approach to cover more advertisers in Adwords

Advertising through web search engines is one of the modes of online advertising and is described as Adwords problem. In Adwords, advertisers bid on keywords to display advertisements along with corresponding search results. During keyword auction, there is very high competition for the frequent keywords while little to no competition for the less frequent ones. In this paper, we have proposed an approach to utilize the advertisement space related to infrequent keywords to meet the demands of more advertisers by employing the notions of coverage and concept taxonomy. We employed the notion of coverage to form the multiple distinct groups of infrequent keywords. We also employed concept taxonomy to ensure that each group of keywords is semantically related. We have conducted experiments on the search queries dataset of AOL search engine. The results show that the proposed approach has a potential to meet the advertising demands of more number of advertisers over the existing approach.

[1]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[2]  Thomas P. Hayes,et al.  The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.

[3]  Martha Palmer,et al.  Verb Semantics and Lexical Selection , 1994, ACL.

[4]  P. Krishna Reddy,et al.  Coverage patterns for efficient banner advertisement placement , 2011, WWW.

[5]  Enhong Chen,et al.  Context-aware query suggestion by mining click-through and session data , 2008, KDD.

[6]  Wentong Li,et al.  Estimating conversion rate in display advertising from past erformance data , 2012, KDD.

[7]  Dirk Lewandowski.  Web Search Engine Research , 2012 .

[8]  P. Krishna Reddy,et al.  Discovering Coverage Patterns for Banner Advertisement Placement , 2012, PAKDD.

[9]  Tie-Yan Liu,et al.  Bid keyword suggestion in sponsored search based on competitiveness and relevance , 2014, Inf. Process. Manag..

[10]  Simone Paolo Ponzetto,et al.  Deriving a Large-Scale Taxonomy from Wikipedia , 2007, AAAI.

[11]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[12]  Weinan Zhang,et al.  Optimal real-time bidding for display advertising , 2014, KDD.

[13]  Christoph Meinel,et al.  The Metadata Triumvirate: Social Annotations, Anchor Texts and Search Queries , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[14]  Aranyak Mehta,et al.  Online Matching and Ad Allocation , 2013, Found. Trends Theor. Comput. Sci..

[15]  P. Krishna Reddy,et al.  Mining coverage patterns from transactional databases , 2014, Journal of Intelligent Information Systems.

[16]  Huang-Cheng Kuo,et al.  Building a Concept Hierarchy by Hierarchical Clustering with Join/Merge Decision , 2006, JCIS.

[17]  Aranyak Mehta,et al.  AdWords and Generalized On-line Matching , 2005, FOCS.

[18]  Olivia R. Liu Sheng,et al.  Analysis of the query logs of a Web site search engine , 2005, J. Assoc. Inf. Sci. Technol..

[19]  Yifan Chen,et al.  Advertising keyword suggestion based on concept hierarchy , 2008, WSDM '08.

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