skip to main content
10.1145/2187836.2187851acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article

Targeting converters for new campaigns through factor models

Published:16 April 2012Publication History

ABSTRACT

In performance based display advertising, campaign effectiveness is often measured in terms of conversions that represent some desired user actions like purchases and product information requests on advertisers' website. Hence, identifying and targeting potential converters is of vital importance to boost campaign performance. This is often accomplished by marketers who define the user base of campaigns based on behavioral, demographic, search, social, purchase, and other characteristics. Such a process is manual and subjective, it often fails to utilize the full potential of targeting. In this paper we show that by using past converted users of campaigns and campaign meta-data (e.g., ad creatives, landing pages), we can combine disparate user information in a principled way to effectively and automatically target converters for new/existing campaigns. At the heart of our approach is a factor model that estimates the affinity of each user feature to a campaign using historical conversion data. In fact, our approach allows building a conversion model for a brand new campaign through campaign meta-data alone, and hence targets potential converters even before the campaign is run. Through extensive experiments, we show the superiority of our factor model approach relative to several other baselines. Moreover, we show that the performance of our approach at the beginning of a campaign's life is typically better than the other models even when they are trained using all conversion data after the campaign has completed. This clearly shows the importance and value of using historical campaign data in constructing an effective audience selection strategy for display advertising.

References

  1. Bluekai. www.bluekai.com/.Google ScholarGoogle Scholar
  2. Rightmedia. http://rightmedia.com/.Google ScholarGoogle Scholar
  3. D. Agarwal and B.-C. Chen. Regression-based latent factor models. In KDD, KDD '09, pages 19--28, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Agarwal, B.-C. Chen, and P. Elango. Fast online learning through offline initialization for time-sensitive recommendation. In KDD, pages 703--712, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Argyriou, C. Micchelli, M. Pontil, and Y. Ying. A spectral regularization framework for multi-task structure learning. NIPS, 2008.Google ScholarGoogle Scholar
  6. A. Bagherjeiran, A. O. Hatch, A. Ratnaparkhi, and R. Parekh. Large-scale customized models for advertisers. In ICDM Workshops, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Booth and J. Hobert. Maximizing generalized linear mixed model likelihoods with an automated monte carlo EM algorithm. J.R.Statist. Soc. B, 1999.Google ScholarGoogle Scholar
  8. Y. Chen, D. Pavlov, and J. Canny. Large-scale behavioral targeting. In KDD, pages 209--218, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. of the Royal Statistical Society, Series B, 1977.Google ScholarGoogle Scholar
  10. A. E. Gelfand. Gibbs sampling. Journal of the American Statistical Association, 95:1300--1304, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  11. W. Gilks and P.Wild. Adaptive rejection sampling for gibbs sampling. 41:337--348, 1992.Google ScholarGoogle Scholar
  12. M. Greiner, D. Pfeiffer, and R. D. Smith. Receiver operating characteristic (roc) curves. Preventive Veterinary Medicine, 45:23--41, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  13. S. Lee, V. Chatalbashev, D. Vickrey, and D. Koller. Learning a meta-level prior for feature relevance from multiple related tasks. In ICML, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M.J.Silvapulle. On the existence of maximum likelihood estimates for the binomial response models. Journal of the Royal Statistical Society, Series B, 43:310--313, 1981.Google ScholarGoogle Scholar
  15. R. Neal and G. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. In Learning in Graphical Models, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. J. Pan and Q. Yang. A survey on transfer learning. Technical Report HKUST-CS08-08, Hong Kong University of Science and Technology, 2008.Google ScholarGoogle Scholar
  17. Y. Peng, L. Zhang, M. Chang, and Y. Guan. An effective method for combating malicious scripts clickbots. In ESORICS, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Press and S. Wilson. Choosing between logistic regression and discriminant analysis. Journal of the American Statistical Association, 73:699--705, 1978.Google ScholarGoogle ScholarCross RefCross Ref
  19. A. P. Singh and G. J. Gordon. Relational learning via collective matrix factorization. In KDD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T.Hastie, R.Tibshirani, and J.Friedman. The Elements of Statistical Learning. Springer, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  21. M. E. Tipping and C. M. Bishop. Probabilistic principal components analysis. Journal of the Royal Statistical Socienty, Series B, 61:611--622, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  22. W.R.Gilks, S.Richardson, and D.J.Spiegelhalter. Markov Chain Monte Carlo in Practice. Chapman and Hall, 1996.Google ScholarGoogle Scholar
  23. J. Yan, N. Liu, G. Wang, W. Zhang, Y. Jiang, and Z. Chen. How much can behavioral targeting help online advertising? In WWW, pages 261--270, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Targeting converters for new campaigns through factor models

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      WWW '12: Proceedings of the 21st international conference on World Wide Web
      April 2012
      1078 pages
      ISBN:9781450312295
      DOI:10.1145/2187836

      Copyright © 2012 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 16 April 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate1,899of8,196submissions,23%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader