Improved LRFM model for clustering based on particle swarm optimization algorithm and K-means clustering

Abstract

The effort of this article is to solve one of the main problems in the field of banking, which is closely related to the field of information technology. The combination of the management discussion of this topic with the field of information technology will be one of the important topics in the field of information technology management. The main goal of this article is the clustering of bank customers.At first, all customer characteristics were extracted from the bank's database, which was randomly extracted for 900,000 customers, which will be provided as input to the proposed method of this article. All the characteristics of these customers were extracted and 10 characteristics (except four characteristics of the LRFM method) were listed using the opinions of experts. The proposed method should be able to choose among these 10 features for clustering customers, which results in more resolution in clustering. Due to the high number of cases of this problem, it is not possible to do it manually, and the proposed method tries to provide a separate model for clustering for the customers of each bank by examining different cases. Also, the problem of choosing the right value for the number of clusters in the K-means method is solved by the method proposed in this article. The results show that it is better than the basic RFM and LRFM methods.Keywords: relationship management with bank customers, clustering, RFM model, LRFM model, particle swarm algorithm, K-means method.

Keywords

• clustering
• lrfm model
• particle swarm algorithm
• k-means method