CTR prediction for DSP with improved cube factorization model from historical bidding log

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the real-time bidding (RTB) display advertising ecosystem, demand- side-platforms (DSPs) buy ad impressions through real-time auction or bidding from ad exchanges for advertisers. Receiving a bid request, DSP needs predict the click through rate (CTR) for ads and determine whether to bid and calculates the bid price according to the CTR estimated. In this paper, we address CTR estimation in DSP as a recommendation issue. Due to the complicated trilateral interactions among users, ads and publishers (web pages), conventional matrix factorization does not perform well. Adopting ideas from high-order singular value decomposition (HOSVD), we extend two dimensional matrix factorization model to three dimensional cube factorization containing users, ads and publishers, and propose an improved cube factorization model to address it. We evaluate its performance over a real-world advertising dataset and the results demonstrate that the improved cube factorization model outperforms the matrix factorization.

Cite

CITATION STYLE

APA

Shan, L., Lin, L., Shao, D., & Wang, X. (2014). CTR prediction for DSP with improved cube factorization model from historical bidding log. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8836, pp. 17–24). Springer Verlag. https://doi.org/10.1007/978-3-319-12643-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free