|
||||
|
||||
Audience Selection for On-Line Brand Advertising: Privacy-Friendly Social Network TargetingFoster ProvostNew York University Brian Dalessandroaffiliation not provided to SSRN Rod Hookaffiliation not provided to SSRN Xiaohan ZhangNew York University (NYU) - Department of Information, Operations, and Management Sciences Alan Murrayaffiliation not provided to SSRN May, 25 2011 Abstract: This paper describes and evaluates privacy-friendly methods for extracting quasi-social networks from browser behavior on user-generated content sites, for the purpose of finding good audiences for brand advertising (as opposed to click maximizing, for example). Targeting social-network neighbors resonates well with advertisers, and on-line browsing behavior data counterintuitively can allow the identification of good audiences anonymously. Besides being one of the first papers to our knowledge on data mining for on-line brand advertising, this paper makes several important contributions. We introduce a framework for evaluating brand audiences, in analogy to predictive-modeling holdout evaluation. We introduce methods for extracting quasi-social networks from data on visitations to social networking pages, without collecting any information on the identities of the browsers or the content of the social-network pages. We introduce measures of brand proximity in the network, and show that audiences with high brand proximity indeed show substantially higher brand affinity. Finally, we provide evidence that the quasi-social network embeds a true social network, which along with results from social theory offers one explanation for the increases in audience brand affinity.
Number of Pages in PDF File: 9 Keywords: on-line advertising, predictive modeling, social working papers seriesDate posted: May 25, 2011Suggested CitationContact Information
|
|
|||||||||||||||||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo7 in 0.593 seconds