Predicting conversions in display advertising based on URL embeddings

• URL: http://arxiv.org/abs/2008.12003v2
• Date: Fri, 28 Aug 2020 09:09:26 GMT
• Title: Predicting conversions in display advertising based on URL embeddings
• Authors: Yang Qiu, Nikolaos Tziortziotis, Martial Hue, Michalis Vazirgiannis
• Abstract summary: We introduce and examine different models for estimating the probability of a user converting, given their history of visited URLs. Inspired by natural language processing, we introduce three URL embedding models to compute semantically meaningful URL representations.
• Score: 16.63178490961762
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Online display advertising is growing rapidly in recent years thanks to the automation of the ad buying process. Real-time bidding (RTB) allows the automated trading of ad impressions between advertisers and publishers through real-time auctions. In order to increase the effectiveness of their campaigns, advertisers should deliver ads to the users who are highly likely to be converted (i.e., purchase, registration, website visit, etc.) in the near future. In this study, we introduce and examine different models for estimating the probability of a user converting, given their history of visited URLs. Inspired by natural language processing, we introduce three URL embedding models to compute semantically meaningful URL representations. To demonstrate the effectiveness of the different proposed representation and conversion prediction models, we have conducted experiments on real logged events collected from an advertising platform.

Related papers

• Long-Term Ad Memorability: Understanding & Generating Memorable Ads [54.23854539909078]
  There has been no large-scale study on the memorability of ads. We release the first memorability dataset, LAMBDA, consisting of 1749 participants and 2205 ads covering 276 brands.
  arXiv  Detail & Related papers  (2023-09-01T10:27:04Z)
• Online Ad Procurement in Non-stationary Autobidding Worlds [10.871587311621974]
  We introduce a primal-dual algorithm for online decision making with multi-dimension decision variables, bandit feedback and long-term uncertain constraints. We show that our algorithm achieves low regret in many worlds when procurement outcomes are generated through procedures that are adversarial, adversarially corrupted, periodic, and ergodic.
  arXiv  Detail & Related papers  (2023-07-10T00:41:08Z)
• Optimizing Floors in First Price Auctions: an Empirical Study of Yahoo Advertising [0.0]
  We present a model to set floors in first price auctions, and discuss the impact of its implementation on Yahoo sites. Our solution induces bidders to change their bidding behavior as a response to the floors enclosed in the bid request. The annualized incremental revenue is estimated at +1.3% on Yahoo display inventory, and +2.5% on video ad inventory.
  arXiv  Detail & Related papers  (2023-02-12T22:40:53Z)
• Boost CTR Prediction for New Advertisements via Modeling Visual Content [55.11267821243347]
  We exploit the visual content in ads to boost the performance of CTR prediction models. We learn the embedding for each visual ID based on the historical user-ad interactions accumulated in the past. After incorporating the visual ID embedding in the CTR prediction model of Baidu online advertising, the average CTR of ads improves by 1.46%, and the total charge increases by 1.10%.
  arXiv  Detail & Related papers  (2022-09-23T17:08:54Z)
• Multi-Channel Sequential Behavior Networks for User Modeling in Online Advertising [4.964012641964141]
  This paper presents Multi-Channel Sequential Behavior Network (MC-SBN), a deep learning approach for embedding users and ads in a semantic space. Our proposed user encoder architecture summarizes user activities from multiple input channels--such as previous search queries, visited pages, or clicked ads--into a user vector. The results demonstrate that MC-SBN can improve the ranking of relevant ads and boost the performance of both click prediction and conversion prediction.
  arXiv  Detail & Related papers  (2020-12-27T06:13:29Z)
• CAMTA: Causal Attention Model for Multi-touch Attribution [25.258282793367453]
  We propose CAMTA, a novel deep recurrent neural network architecture which is a casual attribution mechanism for user-personalised MTA. We demonstrate the superior performance of CAMTA with respect to prediction accuracy as compared to several baselines.
  arXiv  Detail & Related papers  (2020-12-21T15:05:00Z)
• A novel auction system for selecting advertisements in Real-Time bidding [68.8204255655161]
  Real-Time Bidding is a new Internet advertising system that has become very popular in recent years. We propose an alternative betting system with a new approach that not only considers the economic aspect but also other relevant factors for the functioning of the advertising system.
  arXiv  Detail & Related papers  (2020-10-22T18:36:41Z)
• An Empirical Study of In-App Advertising Issues Based on Large Scale App Review Analysis [67.58267006314415]
  We present a large-scale analysis on ad-related user feedback from App Store and Google Play. From a statistical analysis of 36,309 ad-related reviews, we find that users care most about the number of unique ads and ad display frequency during usage. Some ad issue types are addressed more quickly by developers than other ad issues.
  arXiv  Detail & Related papers  (2020-08-22T05:38:24Z)
• Real-Time Optimization Of Web Publisher RTB Revenues [10.908037452134302]
  This paper describes an engine to optimize web publisher revenues from second-price auctions. The engine is able to predict, for each auction, an optimal reserve price in approximately one millisecond.
  arXiv  Detail & Related papers  (2020-06-12T11:14:56Z)
• Do Interruptions Pay Off? Effects of Interruptive Ads on Consumers Willingness to Pay [79.9312329825761]
  We present the results of a study designed to measure the impact of interruptive advertising on consumers willingness to pay for products bearing the advertiser's brand. Our results contribute to the research on the economic impact of advertising, and introduce a method of measuring actual (as opposed to self-reported) willingness to pay in experimental marketing research.
  arXiv  Detail & Related papers  (2020-05-14T09:26:57Z)
• Online Joint Bid/Daily Budget Optimization of Internet Advertising Campaigns [115.96295568115251]
  We study the problem of automating the online joint bid/daily budget optimization of pay-per-click advertising campaigns over multiple channels. For every campaign, we capture the dependency of the number of clicks on the bid and daily budget by Gaussian Processes. We design four algorithms and show that they suffer from a regret that is upper bounded with high probability as O(sqrtT) We present the results of the adoption of our algorithms in a real-world application with a daily average spent of 1,000 Euros for more than one year.
  arXiv  Detail & Related papers  (2020-03-03T11:07:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.