Score Look-Alike Audiences
Authors:
- Qiang MaQMQiang Ma
- Eeshan WaghEWEeshan Wagh
- Jiayi WenJWJiayi Wen
- Zhen XiaZXZhen Xia
- Robert OrmandiRORobert Ormandi
- Datong ChenDCDatong Chen
- 1 December 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 647-654
Abstract
Look-alike models, which are efficient tools for finding similar users from a smaller user set, are quickly revolutionizing the online programmatic advertising industry. The datasets in these contexts exhibit extremely sparse feature spaces on a massive scale, so traditionally, the state-of-the-art look-alike models have used pairwise similarities to construct these similar user sets. One of the key challenges of the similarity-based models is that they do not provide a way to measure the potential value of the users to an advertiser, which is crucial in an advertising context. We propose methods to score users within the expanded audience in a way which relates directly to the business metric that the advertiser wants to optimize. We present three scoring models and show that, through empirical evaluation using real-world, large-scale data, by incorporating the potential value of a user to an advertiser into our scoring model, we can significantly improve the performance of the look-alike models over methods which only use pairwise similarities of users.Keywords
This publication has 18 references indexed in Scilit:
- Big data analytics and big data science: a surveyJournal of Management Analytics, 2016
- Effective Audience Extension in Online Advertising2015
- The rise of “big data” on cloud computing: Review and open research issuesInformation Systems, 2015
- The Stratosphere platform for big data analyticsThe VLDB Journal, 2014
- CassandraACM SIGOPS Operating Systems Review, 2010
- BigtableACM Transactions on Computer Systems, 2008
- Contextual advertising by combining relevance with click feedback2008
- Exploiting asymmetry in hierarchical topic extraction2006
- Similarity estimation techniques from rounding algorithms2002
- Efficient large-scale sequence comparison by locality-sensitive hashingBioinformatics, 2001