The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Machine-Learning Techniques for Customer Retention: A Comparative Study
Open accessAbstract
Nowadays, customers have become more interested in the quality of service (QoS) that organizations can provide them. Services provided by different vendors are not highly distinguished which increases competition between organizations to maintain and increase their QoS. Customer Relationship Management systems are used to enable organizations to acquire new customers, establish a continuous relationship with them and increase customer retention for more profitability. CRM systems use machine-learning models to analyze customers’ personal and behavioral data to give organization a competitive advantage by increasing customer retention rate. Those models can predict customers who are expected to churn and reasons of churn. Predictions are used to design targeted marketing plans and service offers. This paper tries to compare and analyze the performance of different machine-learning techniques that are used for churn prediction problem. Ten analytical techniques that belong to different categories of learning are chosen for this study. The chosen techniques include Discriminant Analysis, Decision Trees (CART), instance-based learning (k-nearest neighbors), Support Vector Machines, Logistic Regression, ensemble–based learning techniques (Random Forest, Ada Boosting trees and Stochastic Gradient Boosting), Naïve Bayesian, and Multi-layer perceptron. Models were applied on a dataset of telecommunication that contains 3333 records. Results show that both random forest and ADA boost outperform all other techniques with almost the same accuracy 96%. Both Multi-layer perceptron and Support vector machine can be recommended as well with 94% accuracy. Decision tree achieved 90%, naïve Bayesian 88% and finally logistic regression and Linear Discriminant Analysis (LDA) with accuracy 86.7%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Learning internal representations by error propagation
RUMELHART, D. E., HINTON, G. E., & WILLIAMS, R. J. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50035-2 · Cited by 3,002
PRINCIPLES OF NEURODYNAMICS. PERCEPTRONS AND THE THEORY OF BRAIN MECHANISMS
ROSENBLATT, F. (1961) · doi:10.21236/ad0256582 · Cited by 1,691
A comparison of machine learning techniques for customer churn prediction
Vafeiadis, T., Diamantaras, K. I., Sarigiannidis, G., & Chatzisavvas, K. C. (2015) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2015.03.003 · Cited by 471
Idris, A., Rizwan, M., & Khan, A. (2012) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2012.09.001 · Cited by 139
Coussement, K., Benoit, D. F., & Van den Poel, D. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.07.029 · Cited by 117
Investigating purchasing-sequence patterns for financial services using Markov, MTD and MTDg models
Prinzie, A., & Van den Poel, D. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.05.004 · Cited by 75 · cited 1×
“Up and/or Cross selling include activities that increase the transactions of the associated services/products [13], [14].”
Background
Cited by
Systematic reviews in sentiment analysis: a tertiary study
Ligthart, A., Catal, C., & Tekinerdogan, B. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-021-09973-3 · Cited by 303
Machine Learning Approaches for Auto Insurance Big Data
Hanafy, M., & Ming, R. (2021) · Risks · doi:10.3390/risks9020042 · Cited by 102
Domingos, E., Ojeme, B., & Daramola, O. (2021) · Computation · doi:10.3390/computation9030034 · Cited by 77
Metadata
- Authors
- F., S.
- Venue
- International Journal of Advanced Computer Science and Applications
- Published
- 2018
- Volume
- 9
- Issue
- 2
- ISSN
- 2156-5570 (ISSN-L)
- 2158-107X
- OpenAlex
- W2789071465
- Cited by
- 173
- References
- 8
- FWCI
- 24.99
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.