Clustering algorithm for electronic services customers: A case study of the banking industry

Article Type:
Research/Original Article (دارای رتبه معتبر)

Today, recognizing and retaining customers is one of the major challenges of customer-oriented organizations, especially in the field of banking, which has attracted the attention of many researchers. With the increasing growth of customers and the use of electronic devices that have led to the production of large volumes of data, customer behavior analysis can be considered as a competitive factor for them. In this paper, considering the varied density and data growth that leads to computational overhead, a combined approach is used of the RFM method , density-based clustering algorithm and Map-Reduce( which is an efficient and low-cost framework for running synchronous algorithms.) it is used. The results show that the proposed algorithm is more accurate than VDMR-DBSCAN. Also, the output of the algorithm is in the form of 5 clusters, the results of which can help managers in identifying valuable customers, and This method leads to increased revenue and reduced unnecessary costs that occur due to lack of recognition and incorrect segmentation of customers.

International Journal Of Nonlinear Analysis And Applications, Volume:13 Issue: 2, Summer-Autumn 2022
173 to 184  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!