Coverage Patterns-Based Approach to Allocate Advertisement Slots for Display Advertising

Display advertising is one of the predominant modes of online advertising. A publisher makes efforts to allocate the available ad slots/page views to meet the demands of the maximum number of advertisers for maximizing the revenue. Investigating efficient approaches for ad slot allocation to advertisers is a research issue. In the literature, efforts are being made to propose approaches by extending optimization techniques. In this paper, we propose an improved approach for ad slot allocation by exploiting the notion of coverage patterns. In the literature, an approach is proposed to extract the knowledge of coverage patterns from the transactional databases. In the display advertising scenario, we propose an efficient ad slot allocation approach by exploiting the knowledge of coverage patterns extracted from the click stream transactions. The proposed allocation framework, in addition to the step of extraction of coverage patterns, contains mapping, ranking and allocation steps. The experimental results on both synthetic and real world click stream datasets show that the proposed approach could meet the demands of increased number of advertisers and reduces the boredom faced by user by reducing the repeated display of advertisements.

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

[2]  Sergei Vassilvitskii,et al.  Bidding for Representative Allocations for Display Advertising , 2009, WINE.

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

[4]  Fabrizio Caruso,et al.  Heuristic Bayesian targeting of banner advertising , 2015 .

[5]  P. Krishna Reddy,et al.  Content specific coverage patterns for banner advertisement placement , 2014, 2014 International Conference on Data Science and Advanced Analytics (DSAA).

[6]  Morteza Zadimoghaddam,et al.  Simultaneous approximations for adversarial and stochastic online budgeted allocation , 2012, SODA.

[7]  Sergei Vassilvitskii,et al.  Inventory Allocation for Online Graphical Display Advertising , 2010, ArXiv.

[8]  Jiawei Han,et al.  Data Mining for Web Intelligence , 2002, Computer.

[9]  Naoki Abe,et al.  Improvements to the Linear Programming Based Scheduling of Web Advertisements , 2005, Electron. Commer. Res..

[10]  Aranyak Mehta,et al.  Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[11]  Jaideep Srivastava,et al.  Web usage mining: discovery and applications of usage patterns from Web data , 2000, SKDD.

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

[13]  Xiangji Huang,et al.  Comparison of interestingness functions for learning web usage patterns , 2002, CIKM '02.

[14]  Jian Yang,et al.  Delivering Guaranteed Display Ads under Reach and Frequency Requirements , 2014, AAAI.

[15]  Nicole Immorlica,et al.  A combinatorial allocation mechanism with penalties for banner advertising , 2008, WWW.

[16]  Jon Feldman,et al.  Online Stochastic Packing Applied to Display Ad Allocation , 2010, ESA.

[17]  Yossi Matias,et al.  Scheduling space-sharing for internet advertising , 2002, Journal of Scheduling.

[18]  P. Krishna Reddy,et al.  CPPG: Efficient Mining of Coverage Patterns Using Projected Pattern Growth Technique , 2013, PAKDD Workshops.

[19]  Sergei Vassilvitskii,et al.  Optimal online assignment with forecasts , 2010, EC '10.

[20]  Sergei Vassilvitskii,et al.  SHALE: an efficient algorithm for allocation of guaranteed display advertising , 2012, KDD.

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

[22]  P. Krishna Reddy,et al.  An approach to cover more advertisers in Adwords , 2015, 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA).