Name
Title | ||
|---|---|---|
Dimensionality reduction for click-through rate prediction: Dense versus sparse representation. |
Abstract | ||
|---|---|---|
In online advertising, display ads are increasingly being placed based on real-time auctions where the advertiser who wins gets to serve the ad. This is called real-time bidding (RTB). In RTB, auctions have very tight time constraints on the order of 100ms. Therefore mechanisms for bidding intelligently such as clickthrough rate prediction need to be sufficiently fast. In this work, we propose to use dimensionality reduction of the user-website interaction graph in order to produce simplified features of users and websites that can be used as predictors of clickthrough rate. We demonstrate that the Infinite Relational Model (IRM) as a dimensionality reduction offers comparable predictive performance to conventional dimensionality reduction schemes, while achieving the most economical usage of features and fastest computations at run-time. For applications such as real-time bidding, where fast database I/O and few computations are key to success, we thus recommend using IRM based features as predictors to exploit the recommender effects from bipartite graphs. |
Year | Venue | Field |
|---|---|---|
2013 | neural information processing systems | Data mining,Click-through rate,Dimensionality reduction,Computer science,Sparse approximation,Bipartite graph,Online advertising,Common value auction,Artificial intelligence,Relational model,Bidding,Machine learning |
DocType | Volume | Citations |
Journal | abs/1311.6976 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bjarne Ørum Fruergaard | 1 | 0 | 0.34 |
| Toke Jansen Hansen | 2 | 7 | 1.84 |
| Lars Kai Hansen | 3 | 2776 | 341.03 |