Learning to advertise: how many ads are enough?

  • Authors:

  • Bo Wang;Zhaonan Li;Jie Tang;Kuo Zhang;Songcan Chen;Liyun Ru

  • Affiliations:

  • Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, China;Department of Computer Science, Tsinghua University, Beijing, China;Department of Computer Science, Tsinghua University, Beijing, China;Sohu Inc. R&D center, Beijing, China;Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, China;Sohu Inc. R&D center, Beijing, China

  • Venue:
  • PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Sponsored advertisement(ad) has already become the major source of revenue for most popular search engines. One fundamental challenge facing all search engines is how to achieve a balance between the number of displayed ads and the potential annoyance to the users. Displaying more ads would improve the chance for the user clicking an ad. However, when the ads are not really relevant to the users' interests, displaying more may annoy them and even "train" them to ignore ads. In this paper, we study an interesting problem that how many ads should be displayed for a given query. We use statistics on real ads click-through data to show the existence of the problem and the possibility to predict the ideal number. There are two main observations: 1) when the click entropy of a query exceeds a threshold, the CTR of that query will be very near zero; 2) the threshold of click entropy can be automatically determined when the number of removed ads is given. Further, we propose a learning approach to rank the ads and to predict the number of displayed ads for a given query. The experimental results on a commercial search engine dataset validate the effectiveness of the proposed approach.