Skip to main content
Log in

Global Optimization for Advertisement Selection in Sponsored Search

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Advertisement (ad) selection plays an important role in sponsored search, since it is an upstream component and will heavily influence the effectiveness of the subsequent auction mechanism. However, most existing ad selection methods regard ad selection as a relatively independent module, and only consider the literal or semantic matching between queries and keywords during the ad selection process. In this paper, we argue that this approach is not globally optimal. Our proposal is to formulate ad selection as such an optimization problem that the selected ads can work together with downstream components (e.g., the auction mechanism) to achieve the maximization of user clicks, advertiser social welfare, and search engine revenue (we call the combination of these objective functions as the marketplace objective for ease of reference). To this end, we 1) extract a bunch of features to represent each pair of query and keyword, and 2) train a machine learning model that maps the features to a binary variable indicating whether the keyword is selected or not, by maximizing the aforementioned marketplace objective. This formalization seems quite natural; however, it is technically difficult because the marketplace objective is non-convex, discontinuous, and indifferentiable regarding the model parameter due to the ranking and second-price rules in the auction mechanism. To tackle the challenge, we propose a probabilistic approximation of the marketplace objective, which is smooth and can be effectively optimized by conventional optimization techniques. We test the ad selection model learned with our proposed method using the sponsored search log from a commercial search engine. The experimental results show that our method can significantly outperform several ad selection algorithms on all the metrics under investigation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Edelman B, Ostrovsky M, Schwarz M. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American Economic Review, 2007, 97(1): 242–259.

    Article  Google Scholar 

  2. Varian H R. Position auctions. International Journal of Industrial Organization, 2007, 25(6): 1163–1178.

    Article  Google Scholar 

  3. Broder A Z, Ciccolo P, Fontoura M, Gabrilovich E, Josifovski V, Riedel L. Search advertising using Web relevance feedback. In Proc. the 17th ACM Conf. Information and Knowledge Management, October 2008, pp.1013-1022.

  4. Choi Y, Fontoura M, Gabrilovich E, Josifovski V, Mediano M, Pang B. Using landing pages for sponsored search ad selection. In Proc. the 19th WWW, April 2010, pp.251-260.

  5. Broder A Z, Ciccolo P, Gabrilovich E, Josifovski V, Metzler D, Riedel L, Yuan J. Online expansion of rare queries for sponsored search. In Proc. the 18th WWW, April 2009, pp.511-520.

  6. Fuxman A, Tsaparas P, Achan K, Agrawal R. Using the wisdom of the crowds for keyword generation. In Proc. the 17th WWW, April 2008, pp.61-70.

  7. Hillard D, Schroedl S, Manavoglu E, Raghavan H, Leggetter C. Improving ad relevance in sponsored search. In Proc. the 3rd ACM International Conference on Web Search and Data Mining, February 2010, pp.361-370.

  8. Wang H, Liang Y, Fu L, Xue G R, Yu Y. Efficient query expansion for advertisement search. In Proc. the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, July 2009, pp.51-58.

  9. Antonellis I, Molina H G, Chang C C. Simrank++: Query rewriting through link analysis of the click graph. Proc. VLDB Endow., 2008, 1(1): 408–421.

    Article  Google Scholar 

  10. Leme R P, Tardos E. Pure and Bayes-Nash price of anarchy for generalized second-price auction. In Proc. the 51st IEEE Annual Symposium on Foundations of Computer Science, October 2010, pp.735-744.

  11. Caragiannis I, Kaklamanis C, Kanellopoulos P, Kyropoulou M. On the efficiency of equilibria in generalized second-price auctions. In Proc. the 12th ACM Conference on Electronic Commerce, June 2011, pp.81-90.

  12. Lucier B, Paes Leme R. GSP auctions with correlated types. In Proc. the 12th ACM Conf. Electronic Commerce, June 2011, pp.71-80.

  13. Christodoulou G, Kovács A, Schapira M. Bayesian combinatorial auctions. In Proc. the 35th ICALP, Part I, July 2008, pp.820-832.

  14. Lucier B, Borodin A. Price of anarchy for greedy auctions. In Proc. the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, January 2010, pp.537-553.

  15. Taylor M, Guiver J, Robertson S, Minka T. SoftRank: Optimizing non-smooth rank metrics. In Proc. the Int. Conf. Web Search and Web Data Mining, February 2008, pp.77-86.

  16. Jeh G, Widom J. SimRank: A measure of structuralcontext similarity. In Proc. the 8th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, July 2002, pp.538-543.

  17. Joachims T. Making large-scale support vector machine learning practical. In Advances in Kernel Methods, Schölkopf B, Burges C J C, Smola A J (eds.), MIT Press, Cambridge, MA, USA, 1999, pp.169-184.

    Google Scholar 

  18. Brown P F, Pietra V J D, Pietra S A D, Mercer R L. The mathematics of statistical machine translation: Parameter estimation. Comput. Linguist., 1993, 19(2): 263–311.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qing Cui.

Additional information

Special Section on Applications and Industry

The work was done when the first author was an intern at Microsoft Research Asia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cui, Q., Bai, FS., Gao, B. et al. Global Optimization for Advertisement Selection in Sponsored Search. J. Comput. Sci. Technol. 30, 295–310 (2015). https://doi.org/10.1007/s11390-015-1523-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-015-1523-4

Keywords

Navigation