A cross-border community for researchers with openness, equality and inclusion
Join USS Create Account Sign In
Join USS Create Account Sign In
Presentation details
  1. Home
  2. Presentation list
  3. Presentation details
CUSTOMER CHURN PREDICTION USING ML MODELS
ID：98 View protection：Participant Only Updated time：2025-12-23 13:10:40 Views：96 In-person

Start Time：2025-12-29 14:30

Duration：15min

Session：[S5] Track 5: Emerging Trends of AI/ML [S5-1] Track 5: Emerging Trends of AI/ML

No file yet

Abstract
Predicting customer churn is an essential part of retention strategy for telecom companies so as to maximize revenue. In this paper, four machine learning models, Random Forest, Gradient Boosting, Logistic Regression, and K-Nearest Neighbors are compared to predict customer churn using a telecom dataset. We use SMOTE-Tomek to cope with class imbalance and optimize models by using GridSearchCV, Optuna, and Grey Wolf Optimizer. Our optimized Random Forest has 85.9% of accuracy beating other models. The study reveals the main churn factors such as type of contract and the usage of services, which are useful in developing targeted retention strategies for telecom providers..
Keywords
Customer churn, machine learning, Random Forest, SMOTE, hyperparameter optimization
Speaker
Waleed Alomoush
Plekhanov Russian University of Economics in Dubai.； Dubai Knowledge Park； Dubai； UAE

Post comments
Verification Code Change Another
All comments
Important Dates

  • Conference date

    12-29

    2025

    -

    12-31

    2025

  • 12-30 2025

    Presentation submission deadline

  • 02-10 2026

    Draft paper submission deadline

  • 02-10 2026

    Registration deadline

Sponsored By

United Societies of Science

Organized By

扎尔卡大学

Contact info
Previous Conferences
请输入有效的邮箱地址
© Copyright 2024 USS - the United Societies of Science - All rights reserved. The USS website is developed and maintained by BoomSCI limited.
×

USS WeChat Official Account

USSsociety

Please scan the QR code to follow
the wechat official account.