25 citations · 53 across the 6 of their papers we have counts for
6 papers
Sketching, Embedding, and Dimensionality Reduction for Information Spaces
Amirali Abdullah, Ravi Kumar, Andrew McGregor +2
Information distances like the Hellinger distance and the Jensen-Shannon divergence have deep roots in information theory and machine learning. They are used extensively in data an…
Value of Targeting
Kshipra Bhawalkar, Patrick Hummel, Sergei Vassilvitskii
We undertake a formal study of the value of targeting data to an advertiser. As expected, this value is increasing in the utility difference between realizations of the targeting d…
Scalable K-Means++
Bahman Bahmani, Benjamin Moseley, Andrea Vattani +2
Over half a century old and showing no signs of aging, k-means remains one of the most popular data processing algorithms. As is well-known, a proper initialization of k-means is c…
SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising
Vijay Bharadwaj, Peiji Chen, Wenjing Ma +5
Motivated by the problem of optimizing allocation in guaranteed display advertising, we develop an efficient, lightweight method of generating a compact {\em allocation plan} that…
Ad Serving Using a Compact Allocation Plan
Peiji Chen, Wenjing Ma, Srinath Mandalapu +6
A large fraction of online display advertising is sold via guaranteed contracts: a publisher guarantees to the advertiser a certain number of user visits satisfying the targeting p…
Inventory Allocation for Online Graphical Display Advertising
Jian Yang, Erik Vee, Sergei Vassilvitskii +4
We discuss a multi-objective/goal programming model for the allocation of inventory of graphical advertisements. The model considers two types of campaigns: guaranteed delivery (GD…