Approaches to Clustering in Customer Segmentation
Keywords:Customer Relationship Management, Customer Segmentation, Clustering, K-Means Clustering, Hierarchical Clustering
Customer Relationship Management(CRM) has always played a crucial role as a market strategy for providing organizations with the quintessential business intelligence for building, managing and developing valuable long-term customer relationships. A number of business enterprises have come to realize the significance of CRM and the application of technical expertise to achieve competitive advantage. This study explores the importance of Customer Segmentation as a core function of CRM as well as the various models for segmenting customers using clustering techniques. The available clustering models for customer segmentation, in general, and the major models of K-Means and Hierarchical Clustering, in particular, are studied and the virtues and vices of the techniques are pointed out. Finally, the possibility of developing a hybrid solution by the combination of the above two techniques, having the ability to outperform the individual models, is discussed.
] E. Ngai, L. Xiu and D. Chau, â€œApplication of data mining techniques in customer relationship management: A literature review and classificationâ€, Expert Systems with Applications, vol. 36, no. 2, pp. 2592-2602, 2009.
 J. Peppard, â€œCustomer Relationship Management (CRM) in financial servicesâ€, European Management Journal, vol. 18, no. 3, pp. 312-327, 2000.
 A. Ansari and A. Riasi, â€œTaxonomy of marketing strategies using bank customers clusteringâ€, International Journal of Business and Management, vol. 11, no. 7, pp. 106-119, 2016.
 M. Ghzanfari, et al., â€œCustomer segmentation in clothing exports based on clustering algorithmâ€, Iranian Journal of Trade Studies, vol. 14, no. 56, pp. 59-86, 2010.
 C. Rygielski, J. Wang and D. Yen, â€œData mining techniques for customer relationship managementâ€, Technology in Society, vol. 24, no. 4, pp. 483-502, 2002.
 J. Lee and S. Park, â€œIntelligent profitable customers segmentation system based on business intelligence toolsâ€, Expert Systems with Applications, vol. 29, no. 1, pp. 145-152, 2005.
 D. A. Kandeil, A. A. Saad and S. M. Youssef, â€œA two-phase clustering analysis for B2B customer segmentationâ€, in International Conference on Intelligent Networking and Collaborative Systems, Salerno, 2014, pp. 221-228.
 R. Swift, Accelerating Customer Relationships: Using CRM and Relationship Technologies, 1st ed. Upper Saddle River, N.J.: Prentice Hall PTR, 2000.
 A. Parvatiyar and J. N. Sheth, â€œCustomer relationship management: Emerging practice, process and disciplineâ€, Journal of Economic and Social Research, vol. 3, no. 2, pp. 1-34, 2001.
 A. Riasi, â€œBarriers to international supply chain management in Iranian flower industryâ€, Management Science Letters, vol. 5, no. 4, pp. 363-368, 2015.
 A. Riasi, â€œCompetitive advantages of shadow banking industry: An analysis using porter diamond modelâ€, Business Management and Strategy, vol. 6, no. 2, pp. 15-27, 2015.
 J. Qian and C. Gao, â€œThe application of data mining in CRMâ€, in 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), Deng Leng, 2011, pp. 5202-5206.
 D. Liu and Y. Shih, â€œIntegrating AHP and data mining for product recommendation based on customer lifetime valueâ€, Information & Management, vol. 42, no. 3, pp. 387-400, 2005.
 V. Zeithaml, R. Rust and K. Lemon, â€œThe customer pyramid: Creating and serving profitable customersâ€, California Management Review, vol. 43, no. 4, pp. 118-142, 2001.
 A. Ansari and A. Riasi, â€œCustomer clustering using a combination of fuzzy c-means and genetic algorithmsâ€, International Journal of Business and Management, vol. 11, no. 7, pp. 59-66, 2016.
 P. Kotler and G. Armstrong, Principles of marketing. Englewood Cliffs, N.J.: Prentice Hall, 1991.
 J. Aaker, A. Brumbaugh and S. Grier, â€œNontarget Markets and Viewer Distinctiveness: The Impact of Target Marketing on Advertising Attitudesâ€, Journal of Consumer Psychology, vol. 9, no. 3, pp. 127-140, 2000.
 Q. Zhao and P. Franti, â€œCentroid Ratio for a Pairwise Random Swap Clustering Algorithmâ€, IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 5, pp. 1090-1101, 2014.
 I. Dhillon and D. Modha, â€œConcept decompositions for large sparse text data using clusteringâ€, Machine Learning, vol. 42, no. 1/2, pp. 143-175, 2001.
 T. Kanungo, et al., â€œAn efficient k-means clustering algorithm: analysis and implementationâ€,IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 881-892, 2002.
 D. MacKay, â€œAn example inference task: Clusteringâ€, in Information theory, inference, and learning algorithms. Cambridge, UK: Cambridge University Press, 2003, pp. 284-292.
 M. Inaba, N. Katoh and H. Imai, â€œApplications of weighted Voronoi diagrams and randomization to variance-based k-clusteringâ€, in Proceedings of the tenth annual symposium on Computational geometry, New York, 1994, pp. 332-339.
 T. Sajana, C. Sheela Rani and K. Narayana, â€œA Survey on Clustering Techniques for Big Data Miningâ€, Indian Journal of Science and Technology, vol. 9, no. 3, 2016.
 O. Maimon and L. Rokach, â€œClustering methodsâ€, in Data Mining and Knowledge Discovery Handbook. Boston: Springer US, 2005, pp. 321-352.
 Y. Chen, et al., â€œIdentifying patients in target customer segments using a two-stage clustering-classification approach: A hospital-based assessmentâ€, Computers in Biology and Medicine, vol. 42, no. 2, pp. 213-221, 2012.
 G. Lefait and T. Kechadi, â€œCustomer segmentation architecture based on clustering techniquesâ€, in Fourth International Conference on Digital Society, Sint Maarten, 2010, pp. 243-248.
 M. Namvar, M. Gholamian and S. KhakAbi, â€œA two-phase clustering method for intelligent customer segmentationâ€, in International Conference on Intelligent Systems, Modelling and Simulation, Liverpool, 2010, pp. 215-219.
 D. Gaur and S. Gaur, â€œComprehensive analysis of data clustering algorithmsâ€, in Future Information Communication
International Journal of Engineering & Technology 807
Technology and Applications. Dordrecht: Springer Netherlands, 2013, pp. 753-762.
 J. MacQueen, â€œSome methods for classification and analysis of multivariate observationsâ€, in Fifth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, 1967, pp. 281-297.
 E. Rendon, et al., â€œA comparison of internal and external cluster validation indexesâ€, in American Conference on Applied Mathematics and The Fifth WSEAS International Conference on Computer Engineering and Applications, Puerto Morelos, 2011, pp. 158-163.
 H. Gucdemir and H. Selim, â€œIntegrating multi-criteria decision making and clustering for business customer segmentationâ€, Industrial Management & Data Systems, vol. 115, no. 6, pp. 1022-1040, 2015.
 T. Kodinariya and P. Makwana, â€œReview on determining number of cluster in K-means clusteringâ€, International Journal of Advance Research in Computer Science and Management Studies, vol. 1, no. 6, pp. 90-95, 2013.
 S. Salvador and P. Chan, â€œDetermining the number of clusters/segments in hierarchical clustering/segmentation algorithmsâ€, in 16th IEEE International Conference on Tools with Artificial Intelligence, Boca Raton, 2004, pp. 576-584.
 D. Zakrzewska and J. Murlewski, â€œClustering algorithms for bank customer segmentationâ€, in 5th International Conference on Intelligent Systems Design and Applications (ISDAâ€Ÿ05), Warsaw, 2005, pp. 197-202.
 P. Brito, et al., â€œCustomer segmentation in a large database of an online customized fashion businessâ€, Robotics and Computer-Integrated Manufacturing, vol. 36, pp. 93-100, 2015.
 P. Badase, G. Deshbhratar and A. Bhagat, â€œClassification and analysis of clustering algorithms for large datasetsâ€, in International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS), Coimbatore, 2015, pp. 1-5.
 C. Xiong, et al., â€œAn Improved K-means Text Clustering Algorithm by Optimizing Initial Cluster Centresâ€, in 7th International Conference on Cloud Computing and Big Data (CCBD), Macau, 2016, pp. 265-268.
 O. A. Abbas, â€œComparisons between data clustering algorithmsâ€, International Arab Journal of Information Technology, vol. 5, no. 3, pp. 320-325, 2008.
 D. Defays, â€œAn efficient algorithm for a complete link methodâ€, The Computer Journal, vol. 20, no. 4, pp. 364-366, 1977.
 R. Sibson, â€œSLINK: An optimally efficient algorithm for the singlelink cluster methodâ€, The Computer Journal, vol. 16, no. 1, pp. 30-34, 1973.
 S. Yoon, et al., â€œA data partitioning approach for hierarchical clusteringâ€, in 7th International Conference on Ubiquitous Information Management and Communication, Kota Kinabalu, 2013, p. 4.
 J. Li, K. Wang and L. Xu, â€œChameleon based on clustering feature tree and its application in customer segmentationâ€, Annals of Operations Research, vol. 168, no. 1, pp. 225-245, 2008.
 D. Suib and M. Deris, â€œAn efficient hierarchical clustering model for grouping web transactionsâ€, International Journal of Business Intelligence and Data Mining, vol. 3, no. 2, pp. 147-157, 2008.
View Full Article:
How to Cite
LicenseAuthors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under aÂ Creative Commons Attribution Licensethat allows others to share the work with an acknowledgement of the work''s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal''s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (SeeÂ The Effect of Open Access).