A service provider is a business that provides services or the expertise of an individual in a certain sector. A service provider’s customer flow could be very dynamic, with both new and churning customers. For the purpose of minimizing the number of churning customers, the company should perform a customer churn analysis. Customer churn analysis is the process of identifying a pattern or trend in churning customers. In order to classify and predict churning customers, machine learning techniques are required to build the classifier model. This paper will use the Support Vector Machine (SVM), Light Gradient Boosting Machine (LightGBM), and hybrid Adaptive Boosting-SVM (AdaBoost-SVM) model. The hybrid AdaBoost-SVM model is a boosting model which uses SVM as its basis classifier instead of a decision tree. The models will be implemented using airlines and telecommunication customers churn data. The usage of oversampling technique is required to balance the number of observations in both classes of training data. Furthermore, a model comparison will be conducted using the F1-Score and the AUC score as the evaluation metric. The analysis shows that LightGBM performs the best result in both dataset with the highest F1-Score and the shortest computational time. In addition, the boosting model AdaBoost-SVM has a better performance than the SVM model due to the boosting algorithm which always minimizes the model error in each iteration. Despite having a better result, AdaBoost-SVM performs in the longest computational time, making it computationally expensive for large datasets. Additionally, the imbalanced nature of the datasets presents challenges in model performance, requiring the application of oversampling techniques to mitigate bias towards the majority class. In conclusion, LightGBM is the best model to classify churning customers based on the higher F1-Score, AUC score, and the shortest computational time.
Jaringan kolaborasi para penulis
12 penulis ·
17 tautan kepenulisan bersama
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Parahyangan Catholic University
Afiliasi tidak diketahui
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.