Advertisement

An Improved Approach for Long Tail Advertising in Sponsored Search

  • Amar BudhirajaEmail author
  • P. Krishna Reddy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10178)

Abstract

Search queries follow a long tail distribution which results in harder management of ad space for sponsored search. During keyword auctions, advertisers also tend to target head query keywords, thereby creating an imbalance in demand for head and tail keywords. This leads to under-utilization of ad space of tail query keywords. In this paper, we have explored a mechanism that allows the advertisers to bid on concepts rather than keywords. The tail query keywords are utilized by allocating a mix of head and tail keywords related to the concept. In the literature, an effort has been made to improve sponsored search by extracting the knowledge of coverage patterns among the keywords of transactional query logs. In this paper, we propose an improved approach to allow advertisers to bid on high level concepts instead of keywords in sponsored search. The proposed approach utilizes the knowledge of level-wise coverage patterns to allocate incoming search queries to advertisers in an efficient manner by utilizing the long tail. Experimental results on AOL search query data set show improvement in ad space utilization and reach of advertisers.

Keywords

Data mining Computational advertising Coverage Patterns Pattern mining Sponsored search 

References

  1. 1.
    Srinivas, P.G., Reddy, P.K., Bhargav, S., Kiran, R.U., Kumar, D.S.: Discovering coverage patterns for banner advertisement placement. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) Advances in Knowledge Discovery and Data Mining. LNCS, vol. 7302, pp. 133–144. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  2. 2.
    Srikant, R., Agrawal, R.: Mining generalized association rules. Future Gener. Comput. Syst. 13, 161–180 (1997)CrossRefGoogle Scholar
  3. 3.
    Budhiraja, A., Reddy, P.K.: An approach to cover more advertisers in adwords. In: IEEE International Conference on Data Science and Advanced Analytics (DSAA 2015), 36678 2015, pp. 1–10 (2015)Google Scholar
  4. 4.
    Srinivas, P.G., Reddy, P.K., Trinath, A.V., Bhargav, S., Kiran, R.U.: Mining coverage patterns from transactional databases. J. Intell. Inf. Syst. 45, 423–439 (2015)CrossRefGoogle Scholar
  5. 5.
    Broder, A., Ciccolo, P., Gabrilovich, E., Josifovski, V., Metzler, D., Riedel, L., Yuan, J.: Online expansion of rare queries for sponsored search. In: International Conference on World Wide Web (2009)Google Scholar
  6. 6.
    Broder, A.Z., Fontoura, M., Gabrilovich, E., Joshi, A., Josifovski, V., Zhang, T.: Robust classification of rare queries using web knowledge. In: International ACM SIGIR Conference on Research and Development in Information Retrieval (2007)Google Scholar
  7. 7.
    Broder, A.Z., Ciccolo, P., Fontoura, M., Gabrilovich, E., Josifovski, V., Riedel, L.: Search advertising using web relevance feedback. In: Proceedings of the 17th ACM conference on Information and Knowledge management (2008)Google Scholar
  8. 8.
    Skiera, B., Eckert, J., Hinz, O.: An analysis of the importance of the long tail in search engine marketing. Electron. Commer. Res. Appl. 9, 488–494 (2010)CrossRefGoogle Scholar
  9. 9.
    Mehta, A., Amin, S., Umesh, V., Vijay, V.: Adwords and generalized online matching. J. ACM (JACM) 54, 22 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Noll, M.G., Meinel, C.: The metadata triumvirate: Social annotations, anchor texts and search queries. In: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2008, vol. 1, pp. 640–647 (2008)Google Scholar
  11. 11.
    Kavya, V.N.S., Reddy, P.K.: Coverage patterns-based approach to allocate advertisement slots for display advertising. In: Bozzon, A., Cudre-Maroux, P., Pautasso, C. (eds.) Web Engineering. LNCS, vol. 9671, pp. 152–169. Springer, Heidelberg (2016)Google Scholar
  12. 12.
    Mehta, A.: Online matching and ad allocation. Theor. Comput. Sci. 8, 265–368 (2012)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.FC Kohli Center in Intelligent SystemsIIIT-HyderabadHyderabadIndia

Personalised recommendations