Journal IJCRT UGC-CARE, UGCCARE( ISSN: 2320-2882 ) | UGC Approved Journal | UGC Journal | UGC CARE Journal | UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, International Peer Reviewed Journal and Refereed Journal, ugc approved journal, UGC CARE, UGC CARE list, UGC CARE list of Journal, UGCCARE, care journal list, UGC-CARE list, New UGC-CARE Reference List, New ugc care journal list, Research Journal, Research Journal Publication, Research Paper, Low cost research journal, Free of cost paper publication in Research Journal, High impact factor journal, Journal, Research paper journal, UGC CARE journal, UGC CARE Journals, ugc care list of journal, ugc approved list, ugc approved list of journal, Follow ugc approved journal, UGC CARE Journal, ugc approved list of journal, ugc care journal, UGC CARE list, UGC-CARE, care journal, UGC-CARE list, Journal publication, ISSN approved, Research journal, research paper, research paper publication, research journal publication, high impact factor, free publication, index journal, publish paper, publish Research paper, low cost publication, ugc approved journal, UGC CARE, ugc approved list of journal, ugc care journal, UGC CARE list, UGCCARE, care journal, UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, ugc care list of journal, ugc care list 2020, ugc care approved journal, ugc care list 2020, new ugc approved journal in 2020, ugc care list 2021, ugc approved journal in 2021, Scopus, web of Science.
How start New Journal & software Book & Thesis Publications

INTERNATIONAL JOURNAL OF CREATIVE RESEARCH THOUGHTS - IJCRT (IJCRT.ORG)

International Peer Reviewed & Refereed Journals, Open Access Journal

IJCRT Peer-Reviewed (Refereed) Journal as Per New UGC Rules.

ISSN Approved Journal No: 2320-2882 | Impact factor: 7.97 | ESTD Year: 2013

Call For Paper - Volume 14 | Issue 3 | Month- March 2026

Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 7.97 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(CrossRef DOI)

Submit Your Paper
Login to Author Home
Communication Guidelines

WhatsApp Contact
Click Here

  Published Paper Details:

  Paper Title

Churn Analysis using ML

  Authors

  Prof.Tushar Surwadkar,  Dr.Varsha Shah,  Prof.Nargis Shaikh,  Prof.Chandramohan Konduri,  Prof.Sachin Charbhe

  Keywords

Churn, Telecom, Machine learning, Random Forest, logistic regression, decision tree, KNN.

  Abstract


Customers are the foundation for any business benefit and that is why firms become conscious of the significance of acquiring satisfaction of customers. Customer churn is one of the major problems and it is regarded as one of the most essential concerns among companies because of increasing among firms, increased significance of marketing policies and customers awareness in present years. Organizations must develop different policies to solve the churn issues depending on the services they offer. Customer churn practice is essential in competitive and rapidly developing in telecom sector. The process of changing from one service provider to another telecom service provider occurs due to good services or rates or due to benefits to the customers which the competitor firm provides customers when signing up. Due to the greater cost related with acquiring new customers the prediction of customer churn has developed as an indispensable part of planning process and strategic decision making in telecom sector. The main aim of the study is to explore the customer churn prediction in telecom using in big machine learning data platform. Machine learning techniques have been used for estimating the customer probability to churn. This study makes use of logistic regression and KNN with big data for predicting consumer churn in the telecom sector. Logistic regression has been used widely to estimate the probability of churn as a function of variables set or features of customers. Similarly, for churn K-Nearest Neighbour is used to examine if a customer churns or not based on their feature's proximity to customers in every class. This study uses Kaggle website for dataset in predicting and analysing churn

  IJCRT's Publication Details

  Unique Identification Number - IJCRT2306727

  Paper ID - 240222

  Page Number(s) - g319-g325

  Pubished in - Volume 11 | Issue 6 | June 2023

  DOI (Digital Object Identifier) -    http://doi.one/10.1729/Journal.34887

  Publisher Name - IJCRT | www.ijcrt.org | ISSN : 2320-2882

  E-ISSN Number - 2320-2882

  Cite this article

  Prof.Tushar Surwadkar,  Dr.Varsha Shah,  Prof.Nargis Shaikh,  Prof.Chandramohan Konduri,  Prof.Sachin Charbhe,   "Churn Analysis using ML", International Journal of Creative Research Thoughts (IJCRT), ISSN:2320-2882, Volume.11, Issue 6, pp.g319-g325, June 2023, Available at :http://www.ijcrt.org/papers/IJCRT2306727.pdf

  Share this article

  Article Preview

  Indexing Partners

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
Call For Paper March 2026
Indexing Partner
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
DOI Details

Providing A digital object identifier by DOI.org How to get DOI?
For Reviewer /Referral (RMS) Earn 500 per paper
Our Social Link
Open Access
This material is Open Knowledge
This material is Open Data
This material is Open Content
Indexing Partner

Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 7.97 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer