Information graph model and application to online advertising

  • Authors:
  • Marina Danilevsky;Eunyee Koh

  • Affiliations:
  • University of Illinois Urbana-Champaign, Urbana, Illinois, USA;Adobe Research, San Jose, California, USA

  • Venue:
  • Proceedings of the 1st workshop on User engagement optimization
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an algorithm which adapts a graph-based ranking model to the context of the problem of improving the process of serving advertisements to users. We transform the ad-based clickstream data into a heterogeneous graph model which respects differences in feature types (e.g. geolocation features, or browser-history features). The heterogeneous network model generates meaningful rankings of features which are predictive for each ad, as demonstrated by our classifier's performance. We also discuss how, in addition to serving as the basis for a classifier, this model may also provide an informative view of the data, which is not possible with black-box approaches, and which therefore makes it very suitable to the problem space of targeted ad serving.