skip to main content
10.1145/3227696.3227708acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmisncConference Proceedingsconference-collections
research-article

Promotion Recommendation Method and System Based on Random Forest

Published:16 July 2018Publication History

ABSTRACT

Living in a sharply competitive telecom market, customers are provided with a great variety of promotions of telecom offers which are excessive and complex in recent years. Not only customers have no idea how to choose the suitable promotions but also front-line sales cannot recommend suitable promotions depending on merely the traditional recommendation method, namely, their personal intuition and experiences. In this way, promotion recommendation lacks mobile data usage pattern and consumption level of customers so that telecom operators hardly provide precision marketing. Conclusively, it may be possibly an inappropriate telecom offer, resulting in low customer satisfaction and loyalty, high churn rate, or in the worst case, erosion of average revenue per user (ARPU). Therefore, this study proposes a promotion recommendation method and system based on random forest to analyze the customer profiles and historical mobile data usage. Then the marketing information can be obtained for front-line sales to help make precise marketing strategies and recommending promotions in accordance with these customer features. Eventually, customer satisfaction, customer loyalty and the income of telecom operators can be increasing. In experimental results, more than 500 thousand mobile data usage records of customers in Chunghwa Telecom from January to March in 2017 were collected and analyzed for the evaluation of the proposed method. The accuracy of the proposed method is 93.36% which is higher than the traditional method. It also gains an advantage over other three popular classification algorithms for recommendation.

References

  1. Ho, Tin Kam, "Random Decision Forests", Proceedings of the 3rd International Conference on Document Analysis and Recognition, Montreal, QC, 14-16 August 1995. pp. 278--282. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. K. Yoshii, M. Goto, K. Komatani, T. Ogata, H. G. Okuno "Hybrid Collaborative and Content-based Music Recommendation Using Probabilistic Model with Latent User Preferences," ISMIR, 2006.Google ScholarGoogle Scholar
  3. Strobl C, Boulesteix AL, Zeileis A, Hothorn T., "Bias in random forest variable importance measures: illustrations, sources and a solution", BMC Bioinformatics. 2007;8:25.Google ScholarGoogle ScholarCross RefCross Ref
  4. Strobl C, Boulesteix AL, Kneib T, Augustin T, Zeileis, "A. Conditional Variable Importance for Random Forests", BMC Bioinformatics. 2008;9:307.Google ScholarGoogle ScholarCross RefCross Ref
  5. Rui Jiang, Wanwan Tang, Xuebing Wu, Wenhui Fu, "A random forest approach to the detection of epistatic interactions in case-control studies", BMC Bioinformatics, 2009, vol. 10 pg. S65.Google ScholarGoogle ScholarCross RefCross Ref
  6. Biau, G., Devroye, L., and Lugosi, G, "Consistency of random forests and other averaging classifiers", The Journal of Machine Learning Research. 2008; 9:2015--2033. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Biau, G., "Analysis of a random forests model", The Journal of Machine Learning Research. 2012; 98888:1063--1095. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. W. H. Hu, B. T. Lin, F. S. Lu, J. Y. Jeng, "An Upselling Pricing Model using SDP-based Rating Mechanism with Dynamic Weight", MISNC 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Promotion Recommendation Method and System Based on Random Forest

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      MISNC '18: Proceedings of the 5th Multidisciplinary International Social Networks Conference
      July 2018
      177 pages
      ISBN:9781450364652
      DOI:10.1145/3227696

      Copyright © 2018 ACM

      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: 16 July 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

      Acceptance Rates

      Overall Acceptance Rate57of97submissions,59%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader