Adaptive Weighing Designs for Keyword Value Computation
Date
2009-10-10
DOI
Authors
Byers, John W.
Mitzenmacher, Michael
Zervas, Georgios
Version
OA Version
Citation
Byers, John; Mitzenmacher, Michael; Zervas, Georgios. "Adaptive Weighing Designs for Keyword Value Computation", Technical Report BUCS-TR-2009-031, Computer Science Department, Boston University, October 10, 2009. [Available from: http://hdl.handle.net/2144/1755]
Abstract
Attributing a dollar value to a keyword is an essential part of running any profitable search engine advertising campaign. When an advertiser has complete control over the interaction with and monetization of each user arriving on a given keyword, the value of that term can be accurately tracked. However, in many instances, the advertiser may monetize arrivals indirectly through one or more third parties. In such cases, it is typical for the third party to provide only coarse-grained reporting: rather than report each monetization event, users are aggregated into larger channels and the third party reports aggregate information such as total daily revenue for each channel. Examples of third parties that use channels include Amazon and Google AdSense.
In such scenarios, the number of channels is generally much smaller than the number of keywords whose value per click (VPC) we wish to learn. However, the advertiser has flexibility as to how to assign keywords to channels over time. We introduce the channelization problem: how do we adaptively assign keywords to channels over the course of multiple days to quickly obtain accurate VPC estimates of all keywords? We relate this problem to classical results in weighing design, devise new adaptive algorithms for this problem, and quantify the performance of these algorithms experimentally. Our results demonstrate that adaptive weighing designs that exploit statistics of term frequency, variability in VPCs across keywords, and flexible channel assignments over time provide the best estimators of keyword VPCs.