Abstract
In real time advertising we are interested in finding features that improve click-through rate prediction. One source of available information is the bipartite graph of websites previously engaged by identifiable users. In this work, we investigate three different decompositions of such a graph with varying degrees of sparsity in the representations. The decompositions that we consider are SVD, NMF, and IRM. To quantify the utility, we measure the performances of these representations when used as features in a sparse logistic regression model for click-through rate prediction. We recommend the IRM bipartite clustering features as they provide the most compact representation of browsing patterns and yield the best performance.
Original language | English |
---|---|
Title of host publication | Proceedings of IEEE 24th International Workshop on Machine Learning for Signal Processing (MLSP) |
Number of pages | 6 |
Publisher | IEEE |
Publication date | 2014 |
Pages | 1-6 |
ISBN (Electronic) | 9781479936946 |
DOIs | |
Publication status | Published - 2014 |
Event | 2014 IEEE International Workshop on Machine Learning for Signal Processing - Reims Centre des Congrès, Reims, France Duration: 21 Sept 2014 → 24 Sept 2014 Conference number: 24 https://ieeexplore.ieee.org/xpl/conhome/6945945/proceeding |
Conference
Conference | 2014 IEEE International Workshop on Machine Learning for Signal Processing |
---|---|
Number | 24 |
Location | Reims Centre des Congrès |
Country/Territory | France |
City | Reims |
Period | 21/09/2014 → 24/09/2014 |
Internet address |
Keywords
- Bioengineering
- Communication, Networking and Broadcast Technologies
- Computing and Processing
- Engineering Profession
- Signal Processing and Analysis
- Computational modeling
- Data models
- Logistics
- Matrix decomposition
- Predictive models
- Uniform resource locators
- Vectors