skip to main content
10.1145/3616901.3617017acmotherconferencesArticle/Chapter ViewAbstractPublication PagesfaimlConference Proceedingsconference-collections
research-article

Intelligent Deposit Product Recommendation for Flexible Employees of Housing Provident Fund Based on Random Forest

Authors Info & Claims
Published:05 March 2024Publication History

ABSTRACT

With the rapid development of big data and cloud computing, digital technology has been widely used to develop provident funds. We innovatively apply data mining and machine learning methods to analyze the impact factors of provident fund deposits and the recommendation model of the deposit products for flexible employees. After experiments, our model performs well in the performance evaluation index (such as Accuracy, Recall, and F1-score). Through our model and research analysis, the housing provident fund center can comprehensively analyze and mine the real data, promote more popular customer policies, and provide better customer service.

References

  1. Z. Xie, J. Wang, X. Hong, (2022). A blockchain-based platform of housing provident fund asset-backed securitization. Asia-Pacific Conference on Image Processing, Electronics and Computers (IPEC). pp. 50–55.Google ScholarGoogle ScholarCross RefCross Ref
  2. M. Haran Rosen and O. Sade (2022). Investigating the introduction of fintech advancement aimed to reduce limited attention regarding inactive savings accounts: Data, survey, and field experiment. AEA Papers and Proceedings. 112: 370–75.Google ScholarGoogle ScholarCross RefCross Ref
  3. H. Ko, S. Lee, Y. Park, (2022). A survey of recommendation systems: recommendation models, techniques, and application fields. Electronics. 11(1): 141, 2022.Google ScholarGoogle ScholarCross RefCross Ref
  4. N. V. Chawla, K. W. Bowyer, L. O. Hall, (2002). Smote: synthetic minority over-sampling technique. Journal of artificial intelligence research. 16: 321–357.Google ScholarGoogle ScholarCross RefCross Ref
  5. L. Breiman (2001). Random forests. Machine learning. 45(1): 5–32.Google ScholarGoogle Scholar
  6. C. Strobl, J. Malley, and G. Tutz (2009). An introduction to recursive partitioning: rationale, application, and characteristics of classification and regression trees, bagging, and random forests. Psychological methods. 14(4): 323.Google ScholarGoogle Scholar
  7. J. H. Friedman (2001). Greedy function approximation: a gradient boosting machine. Annals of statistics. pp. 1189-1232.Google ScholarGoogle ScholarCross RefCross Ref
  8. R. J. Lewis (2000). An introduction to classification and regression tree (cart) analysis. Annual meeting of the society for academic emergency medicine.Google ScholarGoogle Scholar
  9. T. Chen and C. Guestrin (2016). Xgboost: A scalable tree boosting system. Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining. pp. 785–794.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. D. Zhang, L. Qian, B. Mao, C. Huang, (2018). A data- driven design for fault detection of wind turbines using random forests and xgboost. IEEE Access. 6: 21(020)-21(031).Google ScholarGoogle ScholarCross RefCross Ref
  11. M. Ahmed, R. Seraj, and S. M. S. Islam (2020). The k-means algorithm: A comprehensive survey and performance evaluation. Electronics. 9(8): 1295.Google ScholarGoogle ScholarCross RefCross Ref
  12. “Scottknottesd”, https://github.com/klainfo/ScottKnottESD.Google ScholarGoogle Scholar

Index Terms

  1. Intelligent Deposit Product Recommendation for Flexible Employees of Housing Provident Fund Based on Random Forest
      Index terms have been assigned to the content through auto-classification.

      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
        FAIML '23: Proceedings of the 2023 International Conference on Frontiers of Artificial Intelligence and Machine Learning
        April 2023
        296 pages
        ISBN:9798400707544
        DOI:10.1145/3616901

        Copyright © 2023 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 the author(s) 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: 5 March 2024

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited
      • Article Metrics

        • Downloads (Last 12 months)4
        • Downloads (Last 6 weeks)4

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format