Volume 5, Issue 3 (2015)                   ORMR 2015, 5(3): 153-168 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

ghorbanpour A, tallai G, panahi M. Clustering Customers of Refah Bank Branches Using Combination of Genetic Algorithm and C- Means in Fuzzy Environment. ORMR 2015; 5 (3) :153-168
URL: http://ormr.modares.ac.ir/article-28-3996-en.html
Abstract:   (9295 Views)
In recent existing environment one of the major challenges that planners and managers are grappling with is customer recognition, and distinguishing between different groups of customers in the field of banking services. It is obvious that using an appropriate model gives the bank the opportunity to fit valuable suggestions along with demands for targeted sectors and provides design and thus improves bank performance from different perspectives. The aim of this study is using and appropriate model for clustering customers based on indexes including novelty, number of transaction and financial factors. In this paper, for clustering data, the genetic algorithm combining with fuzzy C-means is used to overcome problems such as being sensitive to the initial value and getting trapped in the local optimum. The simple random sampling method is used to obtain the sample. The findings show that the first cluster of customers due to its high performance in "novelty", "number of transaction" and "financial factors" index are loyal customers and the second cluster of customers because of low performance in "novelty" index, mean performance in "number of transaction" index and high performance in "financial factors" are among those customers who are turning away from bank.
Full-Text [PDF 164 kb]   (5942 Downloads)    
Article Type: scientific research | Subject: -
Received: 2015/05/31 | Accepted: 2015/11/22 | Published: 2016/04/6

Add your comments about this article : Your username or Email:
CAPTCHA

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.