Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Scaling personalized web search
WWW '03 Proceedings of the 12th international conference on World Wide Web
Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search
IEEE Transactions on Knowledge and Data Engineering
Adaptive web search based on user profile constructed without any effort from users
Proceedings of the 13th international conference on World Wide Web
Improving web search ranking by incorporating user behavior information
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Budget optimization in search-based advertising auctions
Proceedings of the 8th ACM conference on Electronic commerce
MapReduce: simplified data processing on large clusters
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Video suggestion and discovery for youtube: taking random walks through the view graph
Proceedings of the 17th international conference on World Wide Web
Proceedings of the 18th international conference on World wide web
Bid optimization for broad match ad auctions
Proceedings of the 18th international conference on World wide web
On Signatures for Communication Graphs
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Pregel: a system for large-scale graph processing - "ABSTRACT"
Proceedings of the 28th ACM symposium on Principles of distributed computing
A study of cross-validation and bootstrap for accuracy estimation and model selection
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Beyond DCG: user behavior as a predictor of a successful search
Proceedings of the third ACM international conference on Web search and data mining
Stochastic models for budget optimization in search-based advertising
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Learning to target: what works for behavioral targeting
Proceedings of the 20th ACM international conference on Information and knowledge management
Finding the right consumer: optimizing for conversion in display advertising campaigns
Proceedings of the fifth ACM international conference on Web search and data mining
Web-scale user modeling for targeting
Proceedings of the 21st international conference companion on World Wide Web
Factoring past exposure in display advertising targeting
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Budget optimization for online campaigns with positive carryover effects
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Towards a robust modeling of temporal interest change patterns for behavioral targeting
Proceedings of the 22nd international conference on World Wide Web
| Hi-index | 0.00 |
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as well as users' responses to such impressions. This is summarized and reported to the advertisers to help them evaluate the performance of their campaigns and make better budget allocation decisions. The most popular reporting statistics are the click-through rate and the conversion rate. While these are indicative of the effectiveness of an ad campaign, the advertisers often seek to understand more sophisticated long-term effects of their ads on the brand awareness and the user behavior that leads to the conversion, thus creating a need for the reporting measures that can capture both the duration and the frequency of the pathways to user conversions. In this paper, we propose an alternative data mining framework for analyzing user-level advertising data. In the aggregation step, we compress individual user histories into a graph structure, called the adgraph, representing local correlations between ad events. For the reporting step, we introduce several scoring rules, called the adfactors (AF), that can capture global role of ads and ad paths in the adgraph, in particular, the structural correlation between an ad impression and the user conversion. We present scalable local algorithms for computing the adfactors; all algorithms were implemented using the MapReduce programming model and the Pregel framework. Using an anonymous user-level dataset of sponsored search campaigns for eight different advertisers, we evaluate our framework with different adgraphs and adfactors in terms of their statistical fit to the data, and show its value for mining the long-term behavioral patterns in the advertising data.