loading...
Clustering Algorithms for Bank Customer Segmentation
Wroclaw, Poland September 08-September 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISDA.2005.335th International Conference on Intel ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Danuta Zakrzewska, Technical University of Lodz, Poland
Jan Murlewski, Technical University of Lodz, Poland
Market segmentation is one of the most important area of knowledge-based marketing. In banks, it is really a challenging task, as data bases are large and multidimensional. In the paper we consider cluster analysis, which is the methodology, the most often applied in this area. We compare clustering algorithms in cases of high dimensionality with noise. We discuss using three algorithms: density based DBSCAN, kmeans and based on it two-phase clustering process. We compare algorithms concerning their effectiveness and scalability. Some experiments with exemplary bank data sets are presented.
Citation:
Danuta Zakrzewska, Jan Murlewski, "Clustering Algorithms for Bank Customer Segmentation," isda, pp.197-202, 5th International Conference on Intelligent Systems Design and Applications (ISDA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.