The Prediction of CTR Based on Model Fusion Theory

  • Jiehao ChenEmail author
  • Shuliang Wang
  • Ziqian Zhao
  • Jiyun Shi
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 699)


Online advertising makes it possible to show different ads to different customer groups according to their own characteristics, which will definitely prove the efficiency of ads, and we manage to accurate advertising by predicting the CTR of ads based on varieties of algorithm and models. This essay presented a kind of merged model of GBDT and LR, whose accuracy doesn’t heavily depend on the effect of building features artificially. In the GBDT part of the new model, the ways to build the decision trees made it possible to recognize the effective combination of features, on the other hand, the LR part of model makes it possible to deal with large amount of data. At the same test condition, the new model performed better than LR at the range of 1.41% to 1.75% with the standard of MSE, AUC and Log Loss. The results of the experiment show that GBDT model did a great job on building features for LR model without much help from human, which provides a new thought to improve the current CTR prediction models.


CTR prediction Gradient Boosting Decision Trees Logistic Regression Model fusion 


  1. 1.
    Daniel, T.L.: Data Mining Methods and Models. Wiley-IEEE Press, New York (2006)zbMATHGoogle Scholar
  2. 2.
    Harris, D., Harris, S.: Digital Design and Computer Architecture, 2nd edn. Morgan Kaufmann, San Francisco (2012)zbMATHGoogle Scholar
  3. 3.
    He, X., Pan, J., Jin, O., et al.: Practical lessons from predicting clicks on ads at Facebook. In: 20th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1–9. ACM Press (2014)Google Scholar
  4. 4.
    Friedman, J.H.: Greedy function approximation: a gradient boosting machine. J. Ann. Stat. 29(5), 1189–1232 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Breiman, L.I., Friedman, J.H., Olshen, R.A., et al.: Classification and regression trees (CART). J. Biom. 40(3), 17–23 (1984)Google Scholar
  6. 6.
    Harvey, D., Leybourne, S., Newbold, P.: Testing the equality of prediction mean squared errors. Int. J. Forecast. 13(2), 281–291 (1997)CrossRefGoogle Scholar
  7. 7.
    Huang, J., Ling, C.X.: Using AUC and accuracy in evaluating learning algorithms. J. IEEE Trans. Knowl. Data Eng. 17(3), 299–310 (2005)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  • Jiehao Chen
    • 1
    Email author
  • Shuliang Wang
    • 1
  • Ziqian Zhao
    • 1
  • Jiyun Shi
    • 1
  1. 1.School of SoftwareBeijing Institute of TechnologyBeijingChina

Personalised recommendations