Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3063955.3063976acmotherconferencesArticle/Chapter ViewAbstractPublication Pagesacm-turcConference Proceedingsconference-collections
research-article

CLR: coupled logistic regression model for CTR prediction

Published: 12 May 2017 Publication History

Abstract

Online advertisement is a significant element of the Web browsing experience. A good advertising can not only bring benefits to publisher but also improve user satisfaction and extends advertiser's product marketing. To satisfy the desire of all three parties, the click through rate (CTR) prediction of a user to a specified ad in a specific context is of great importance. This challenging problem plays a key role in online advertising system and has to deal with several hard issues. Firstly, the model must process very high dimensional features from frequently changing ad, user and context, most of which are category features having large cardinality and sparse nature extending the dimensionality by two orders of magnitude. Secondly, nonlinear features such as conjunction information must be integrated into the model for a better prediction accuracy. Finally, the model must be able to parallelized efficiently to train from very large scale data sets. To address these problems, we proposed a novel model called Coupled Logistic Regression (CLR), for accurate and efficient CTR prediction. CLR can exploit all features from ad, user, context and nonlinear features among them by seamlessly integrate the conjunction information by employing factorization machine to achieve precise prediction result. And the high-dimensional problem is avoided by decomposing the decision function into two sub ones. Scalability of CLR is ensured through a newly invited MapReduce parallelization strategy, which can reduce communication and waiting time between nodes. Experimental results on real-world data set show that our CLR model can guarantee both accuracy and efficiency on large scale CTR prediction problems.

References

[1]
Hotchkiss, G., S. Alston and G. Edwards, Eye tracking study. Research white paper, Enquiro Search Solutions Inc, 2005.
[2]
Broder, A.Z., Computational advertising and recommender systems. 2008, ACM. p. 1--2.
[3]
Lambrecht, A. and C. Tucker, When does retargeting work? Information specificity in online advertising. Journal of Marketing Research, 2013. 50(5): p. 561--576.
[4]
Nigam, K., J. Lafferty and A. McCallum, Using maximum entropy for text classification. 1999. p. 61--67.
[5]
Menard, S., Applied logistic regression analysis. Vol. 106. 2002: Sage.
[6]
Friedman, J.H., Greedy function approximation: a gradient boosting machine. Annals of statistics, 2001: p. 1189--1232.
[7]
Trofimov, I., A. Kornetova and V. Topinskiy, Using boosted trees for click-through rate prediction for sponsored search. 2012, ACM. p. 2.
[8]
He, X., et al., Practical lessons from predicting clicks on ads at facebook. 2014, ACM. p. 1--9.
[9]
McMahan, H.B., et al., Ad click prediction: a view from the trenches. 2013, ACM. p. 1222--1230.
[10]
Rendle, S., Factorization machines with libfm. ACM Transactions on Intelligent Systems and Technology (TIST), 2012. 3(3): p. 57.
[11]
Agarwal, A., et al., A reliable effective terascale linear learning system. Journal of Machine Learning Research, 2014. 15(1): p. 1111--1133.
[12]
Guo, F., et al., Click chain model in web search. 2009, ACM. p. 11--20.
[13]
Dupret, G.E. and B. Piwowarski, A user browsing model to predict search engine click data from past observations. 2008, ACM. p. 331--338.
[14]
Srikant, R., et al., User browsing models: relevance versus examination. 2010, ACM. p. 223--232.
[15]
Chapelle, O. and Y. Zhang, A dynamic bayesian network click model for web search ranking. 2009, ACM. p. 1--10.
[16]
Craswell, N., et al., An experimental comparison of click position-bias models. 2008, ACM. p. 87--94.
[17]
Zhou, Z., Ensemble methods: foundations and algorithms. 2012: CRC Press.
[18]
Shatnawi, M. and N. Mohamed, Statistical techniques for online personalized advertising: A survey. 2012, ACM. p. 680--687.
[19]
Hua, X., Online Multimedia Advertising: Techniques and Technologies: Techniques and Technologies. 2010: IGI Global.
[20]
Guyon, I. and A.E. Elisseeff, An introduction to variable and feature selection. The Journal of Machine Learning Research, 2003. 3: p. 1157--1182.
[21]
Rendle, S., Factorization machines. 2010, IEEE. p. 995--1000.
[22]
Golub, G.H., P.C. Hansen and D.P. O'Leary, Tikhonov regularization and total least squares. SIAM Journal on Matrix Analysis and Applications, 1999. 21(1): p. 185--194.
[23]
Andrew, G. and J. Gao, Scalable training of L 1-regularized log-linear models. 2007, ACM. p. 33--40.
[24]
Malouf, R., A comparison of algorithms for maximum entropy parameter estimation. 2002, Association for Computational Linguistics. p. 1--7.
[25]
Broyden, C.G., The convergence of a class of double-rank minimization algorithms 1. general considerations. IMA Journal of Applied Mathematics, 1970. 6(1): p. 76--90.
[26]
Byrd, R.H., J. Nocedal and R.B. Schnabel, Representations of quasi-Newton matrices and their use in limited memory methods. Mathematical Programming, 1994. 63(1--3): p. 129--156.
[27]
Nocedal, J., Updating quasi-Newton matrices with limited storage. Mathematics of computation, 1980. 35(151): p. 773--782.
[28]
Minka, T.P., A comparison of numerical optimizers for logistic regression. Unpublished draft, 2003.
[29]
Cortes, C., Y. Mansour and M. Mohri, Learning bounds for importance weighting. 2010. p. 442--450.
[30]
Bradley, A.P., The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern recognition, 1997. 30(7): p. 1145--1159.
[31]
Cortes, C. and M. Mohri, AUC optimization vs. error rate minimization. Advances in neural information processing systems, 2004. 16(16): p. 313--320.
[32]
Chapelle, O., E. Manavoglu and R. Rosales, Simple and scalable response prediction for display advertising. ACM Transactions on Intelligent Systems and Technology (TIST), 2014. 5(4): p. 61.

Cited By

View all
  • (2019)Micro-Browsing Models for Search Snippets2019 IEEE 35th International Conference on Data Engineering (ICDE)10.1109/ICDE.2019.00206(1904-1909)Online publication date: Apr-2019
  • (2019)A Clickthrough Rate Prediction Algorithm Based on Users’ BehaviorsIEEE Access10.1109/ACCESS.2019.29570547(174782-174792)Online publication date: 2019

Index Terms

  1. CLR: coupled logistic regression model for CTR prediction

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ACM TURC '17: Proceedings of the ACM Turing 50th Celebration Conference - China
    May 2017
    371 pages
    ISBN:9781450348737
    DOI:10.1145/3063955
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 May 2017

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. CTR
    2. click-through rate
    3. factorization machine
    4. logistic regression

    Qualifiers

    • Research-article

    Funding Sources

    • Natural Science Foundation of China

    Conference

    ACM TUR-C '17

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 18 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Micro-Browsing Models for Search Snippets2019 IEEE 35th International Conference on Data Engineering (ICDE)10.1109/ICDE.2019.00206(1904-1909)Online publication date: Apr-2019
    • (2019)A Clickthrough Rate Prediction Algorithm Based on Users’ BehaviorsIEEE Access10.1109/ACCESS.2019.29570547(174782-174792)Online publication date: 2019

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media