FinGAN: Generative Adversarial Network for Analytical Customer Relationship Management in Banking and Insurance
Prateek Kate, Vadlamani Ravi, Akhilesh Gangwar

TL;DR
This paper introduces GAN-based data balancing techniques to improve classification accuracy in highly imbalanced banking and insurance datasets, demonstrating superior results over previous methods.
Contribution
It proposes novel GAN-based oversampling and hybrid undersampling-oversampling methods for handling class imbalance in ACRM problems.
Findings
GAN oversampling improves classifier performance
Hybrid undersampling and oversampling outperforms previous methods
Methods achieve higher AUC scores on multiple datasets
Abstract
Churn prediction in credit cards, fraud detection in insurance, and loan default prediction are important analytical customer relationship management (ACRM) problems. Since frauds, churns and defaults happen less frequently, the datasets for these problems turn out to be naturally highly unbalanced. Consequently, all supervised machine learning classifiers tend to yield substantial false-positive rates when trained on such unbalanced datasets. We propose two ways of data balancing. In the first, we propose an oversampling method to generate synthetic samples of minority class using Generative Adversarial Network (GAN). We employ Vanilla GAN [1], Wasserstein GAN [2] and CTGAN [3] separately to oversample the minority class samples. In order to assess the efficacy of our proposed approach, we use a host of machine learning classifiers, including Random Forest, Decision Tree, support…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImbalanced Data Classification Techniques · Vehicle License Plate Recognition · Customer churn and segmentation
MethodsLogistic Regression
