Pepelyshev, Andrey ![]() ![]() |
Preview |
PDF
- Accepted Post-Print Version
Download (399kB) | Preview |
Abstract
We consider the problem of adaptive targeting for real-time bidding for internet advertisement. This problem involves making fast decisions on whether to show a given ad to a particular user. For demand partners, these decisions are based on information extracted from big data sets containing records of previous impressions, clicks and subsequent purchases. We discuss several criteria which allow us to assess the significance of different factors on probabilities of clicks and conversions. We then devise simple strategies that are based on the use of the most influential factors and compare their performance with strategies that are much more computationally demanding. To make the numerical comparison, we use real data collected by Crimtan in the process of running several recent ad campaigns.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Published Online |
Status: | Published |
Schools: | Mathematics |
Subjects: | Q Science > QA Mathematics |
Publisher: | Springer |
ISSN: | 0302-9743 |
Date of First Compliant Deposit: | 12 May 2017 |
Date of Acceptance: | 2 October 2016 |
Last Modified: | 23 Nov 2024 23:15 |
URI: | https://orca.cardiff.ac.uk/id/eprint/100204 |
Citation Data
Actions (repository staff only)
![]() |
Edit Item |