An Exploration of Clustering Algorithms for Customer Segmentation in the UK Retail Market

• URL: http://arxiv.org/abs/2402.04103v1
• Date: Tue, 6 Feb 2024 15:58:14 GMT
• Title: An Exploration of Clustering Algorithms for Customer Segmentation in the UK Retail Market
• Authors: Jeen Mary John, Olamilekan Shobayo, Bayode Ogunleye
• Abstract summary: We aim to develop a customer segmentation model to improve decision-making processes in the retail market industry. To achieve this, we employed a UK-based online retail dataset obtained from the UCI machine learning repository. The results showed the GMM outperformed other approaches, with a Silhouette Score of 0.80.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recently, peoples awareness of online purchases has significantly risen. This has given rise to online retail platforms and the need for a better understanding of customer purchasing behaviour. Retail companies are pressed with the need to deal with a high volume of customer purchases, which requires sophisticated approaches to perform more accurate and efficient customer segmentation. Customer segmentation is a marketing analytical tool that aids customer-centric service and thus enhances profitability. In this paper, we aim to develop a customer segmentation model to improve decision-making processes in the retail market industry. To achieve this, we employed a UK-based online retail dataset obtained from the UCI machine learning repository. The retail dataset consists of 541,909 customer records and eight features. Our study adopted the RFM (recency, frequency, and monetary) framework to quantify customer values. Thereafter, we compared several state-of-the-art (SOTA) clustering algorithms, namely, K-means clustering, the Gaussian mixture model (GMM), density-based spatial clustering of applications with noise (DBSCAN), agglomerative clustering, and balanced iterative reducing and clustering using hierarchies (BIRCH). The results showed the GMM outperformed other approaches, with a Silhouette Score of 0.80.

Related papers

• Emulating Full Client Participation: A Long-Term Client Selection Strategy for Federated Learning [48.94952630292219]
  We propose a novel client selection strategy designed to emulate the performance achieved with full client participation. In a single round, we select clients by minimizing the gradient-space estimation error between the client subset and the full client set. In multi-round selection, we introduce a novel individual fairness constraint, which ensures that clients with similar data distributions have similar frequencies of being selected.
  arXiv  Detail & Related papers  (2024-05-22T12:27:24Z)
• RE-RFME: Real-Estate RFME Model for customer segmentation [0.0]
  We propose an end-to-end pipeline RE-RFME for segmenting customers into 4 groups: high value, promising, need attention, and need activation. We show the effectiveness of the proposed approach on real-world Housing.com datasets for both website and mobile application users.
  arXiv  Detail & Related papers  (2024-04-26T06:19:02Z)
• Fed-CBS: A Heterogeneity-Aware Client Sampling Mechanism for Federated Learning via Class-Imbalance Reduction [76.26710990597498]
  We show that the class-imbalance of the grouped data from randomly selected clients can lead to significant performance degradation. Based on our key observation, we design an efficient client sampling mechanism, i.e., Federated Class-balanced Sampling (Fed-CBS) In particular, we propose a measure of class-imbalance and then employ homomorphic encryption to derive this measure in a privacy-preserving way.
  arXiv  Detail & Related papers  (2022-09-30T05:42:56Z)
• Efficient Distribution Similarity Identification in Clustered Federated Learning via Principal Angles Between Client Data Subspaces [59.33965805898736]
  Clustered learning has been shown to produce promising results by grouping clients into clusters. Existing FL algorithms are essentially trying to group clients together with similar distributions. Prior FL algorithms attempt similarities indirectly during training.
  arXiv  Detail & Related papers  (2022-09-21T17:37:54Z)
• On the Convergence of Clustered Federated Learning [57.934295064030636]
  In a federated learning system, the clients, e.g. mobile devices and organization participants, usually have different personal preferences or behavior patterns. This paper proposes a novel weighted client-based clustered FL algorithm to leverage the client's group and each client in a unified optimization framework.
  arXiv  Detail & Related papers  (2022-02-13T02:39:19Z)
• Clustering of Bank Customers using LSTM-based encoder-decoder and Dynamic Time Warping [0.0]
  Clustering is an unsupervised data mining technique that can be employed to segment customers. The present study uses a real-world financial dataset to cluster bank customers by an encoder-decoder network and the dynamic time warping (DTW) method.
  arXiv  Detail & Related papers  (2021-10-22T13:16:49Z)
• Client Selection Approach in Support of Clustered Federated Learning over Wireless Edge Networks [2.6774008509840996]
  Clustered Federated Multitask Learning (CFL) was introduced as an efficient scheme to obtain reliable specialized models. This paper proposes a new client selection algorithm that aims to accelerate the convergence rate for obtaining specialized machine learning models.
  arXiv  Detail & Related papers  (2021-08-16T21:38:22Z)
• Federated Noisy Client Learning [105.00756772827066]
  Federated learning (FL) collaboratively aggregates a shared global model depending on multiple local clients. Standard FL methods ignore the noisy client issue, which may harm the overall performance of the aggregated model. We propose Federated Noisy Client Learning (Fed-NCL), which is a plug-and-play algorithm and contains two main components.
  arXiv  Detail & Related papers  (2021-06-24T11:09:17Z)
• OPAM: Online Purchasing-behavior Analysis using Machine learning [0.8121462458089141]
  We present a customer purchasing behavior analysis system using supervised, unsupervised and semi-supervised learning methods. The proposed system analyzes session and user-journey level purchasing behaviors to identify customer categories/clusters.
  arXiv  Detail & Related papers  (2021-02-02T17:29:52Z)
• Dynamically Tie the Right Offer to the Right Customer in Telecommunications Industry [0.0]
  This work presents a conceptual model by studying the significant campaign-dependent variables of customer targeting. The outcomes of customer segmentation of this study could be more meaningful and relevant for marketers.
  arXiv  Detail & Related papers  (2020-10-18T16:44:51Z)
• Topology-based Clusterwise Regression for User Segmentation and Demand Forecasting [63.78344280962136]
  Using a public and a novel proprietary data set of commercial data, this research shows that the proposed system enables analysts to both cluster their user base and plan demand at a granular level. This work seeks to introduce TDA-based clustering of time series and clusterwise regression with matrix factorization methods as viable tools for the practitioner.
  arXiv  Detail & Related papers  (2020-09-08T12:10:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.