Towards Financially Inclusive Credit Products Through Financial Time Series Clustering (2402.11066v1)
Abstract: Financial inclusion ensures that individuals have access to financial products and services that meet their needs. As a key contributing factor to economic growth and investment opportunity, financial inclusion increases consumer spending and consequently business development. It has been shown that institutions are more profitable when they provide marginalised social groups access to financial services. Customer segmentation based on consumer transaction data is a well-known strategy used to promote financial inclusion. While the required data is available to modern institutions, the challenge remains that segment annotations are usually difficult and/or expensive to obtain. This prevents the usage of time series classification models for customer segmentation based on domain expert knowledge. As a result, clustering is an attractive alternative to partition customers into homogeneous groups based on the spending behaviour encoded within their transaction data. In this paper, we present a solution to one of the key challenges preventing modern financial institutions from providing financially inclusive credit, savings and insurance products: the inability to understand consumer financial behaviour, and hence risk, without the introduction of restrictive conventional credit scoring techniques. We present a novel time series clustering algorithm that allows institutions to understand the financial behaviour of their customers. This enables unique product offerings to be provided based on the needs of the customer, without reliance on restrictive credit practices.
- Financial Technology as a Basis for Financial Inclusion and its Impact on Profitability: Evidence from Commercial Banks. Int. J. Advance Soft Compu. Appl, 14(2).
- Customer clustering using a combination of fuzzy c-means and genetic algorithms. International Journal of Business and Management, 11(7): 59–66.
- Clustering of Bank Customers using LSTM-based encoder-decoder and Dynamic Time Warping. arXiv preprint arXiv:2110.11769.
- Berka, P.; et al. 2000. Guide to the financial data set. PKDD2000 discovery challenge.
- Analysis of a four-layer series-coupled perceptron. II. Reviews of Modern Physics, 34(1): 135.
- ROCKET: exceptionally fast and accurate time series classification using random convolutional kernels. Data Mining and Knowledge Discovery, 34(5): 1454–1495.
- Deep clustering via joint convolutional autoencoder embedding and relative entropy minimization. In Proceedings of the IEEE international conference on computer vision, 5736–5745.
- Improved deep embedded clustering with local structure preservation. In Ijcai, volume 17, 1753–1759.
- Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, 770–778.
- Long short-term memory. Neural computation, 9(8): 1735–1780.
- Hopfield, J. J. 1982. Neural networks and physical systems with emergent collective computational abilities. Proceedings of the national academy of sciences, 79(8): 2554–2558.
- Hotelling, H. 1933. Analysis of a complex of statistical variables into principal components. Journal of educational psychology, 24(6): 417.
- Hubert, L. 1974. Approximate evaluation techniques for the single-link and complete-link hierarchical clustering procedures. Journal of the American Statistical Association, 69(347): 698–704.
- Deep learning for time series classification: a review. Data mining and knowledge discovery, 33(4): 917–963.
- Auto-encoding variational bayes. arXiv preprint arXiv:1312.6114.
- End-to-end deep representation learning for time series clustering: a comparative study. Data Mining and Knowledge Discovery, 36(1): 29–81.
- Learning representations for time series clustering. Advances in neural information processing systems, 32.
- MacQueen, J.; et al. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1, 281–297. Oakland, CA, USA.
- Madiraju, N. S. 2018. Deep temporal clustering: Fully unsupervised learning of time-domain features. Ph.D. thesis, Arizona State University.
- Umap: Uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426.
- Relational autoencoder for feature extraction. In 2017 International joint conference on neural networks (IJCNN), 364–371. IEEE.
- Use of data mining in banking. International Journal of Engineering Research and Applications, 2(2): 738–742.
- Müller, M. 2007. Dynamic time warping. Information retrieval for music and motion, 69–84.
- Taifi, N. 2023. The Intertwined Role of Big Data with Business Intelligence and Real Time Analysis: A Finance Sector Perspective. In 2023 International Conference on Digital Age & Technological Advances for Sustainable Development (ICDATA), 17–23. IEEE.
- Time series classification from scratch with deep neural networks: A strong baseline. In 2017 International joint conference on neural networks (IJCNN), 1578–1585. IEEE.
- RTFN: A robust temporal feature network for time series classification. Information sciences, 571: 65–86.
- Unsupervised deep embedding for clustering analysis. In International conference on machine learning, 478–487. PMLR.