Author
Listed:
- S. D. Padiya
- Kunal Ther
- Gayatri Balode
- Kalyani Mandavgade
- Sayalee Uike
Abstract
Customer retention is a big deal for making money in businesses, especially in tough fields like banking or telecom and even online shopping. I mean, if customers leave, it hurts a lot, so figuring out who might churn ahead of time is really important. This paper suggests using machine learning on old customer info to predict when people will stop using the service.The idea is to look at things like demographics and how people use the services to spot the ones most at risk. It feels like that could help narrow it down without guessing too much.Before getting into training the models, there was some work on the data. Like dealing with uneven classes where one side has way more examples, filling in missing spots, and turning categories into numbers that the algorithms can handle. That part seems necessary but kind of tedious. We tried out a few supervised models for this, stuff like Stochastic Gradient Boosting, Random Forest, the K-Nearest Neighbors one, and just plain Logistic Regression. To check how they did, metrics like accuracy, precision, recall, and that F1-score came into play. Evaluating them separately helped see differences. From the experiments, it looks like the ensemble types, you know, the boosting and forest ones, did better at predicting churn than the simpler classifiers. Not by a huge margin everywhere, but overall they stood out. I think that makes sense because they combine a lot of decisions.Businesses could use something like this to keep customers around longer, maybe by reaching out early with better offers or whatever. It might not fix everything, but proactive steps could boost loyalty a bit. The whole system shows promise for handling attrition in competitive spots.
Suggested Citation
S. D. Padiya & Kunal Ther & Gayatri Balode & Kalyani Mandavgade & Sayalee Uike, 2026.
"Customer Churn Analysis and Prediction Using Machine Learning Techniques,"
International Journal of Scientific Research in Science and Technology, Technoscience Academy, vol. 13(2), pages 415-422, April.
Handle:
RePEc:etm:ijsrst:v13:y2026:i2:id:1466
DOI: 10.32628/IJSRST2613313
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:etm:ijsrst:v13:y2026:i2:id:1466. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (email available below). General contact details of provider: https://ijsrst.com/home .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.