Applying Split and Merge Algorithm in Customer Relationship Management

Recently, customer relationship management (CRM) has become the core of growth of the company. Data mining, as a powerful data analysis tool, extracts critical information supporting the company to make better decisions by processing a large number of data in commercial databases. This paper introduced the basic concepts of data mining and CRM, and described the process how to use data mining for CRM. This paper presents SaM, a split and merge algorithm for frequent item set mining. Its core advantages are its extremely simple data structure and processing scheme, which not only make it very easy to implement. At last, the paper described the applications of several main data mining methods in CRM.

[1]  Christian Borgelt,et al.  Simple Algorithms for Frequent Item Set Mining , 2010, Advances in Machine Learning II.

[2]  Cheng Yang,et al.  Efficient discovery of error-tolerant frequent itemsets in high dimensions , 2001, KDD '01.

[3]  Kun Wu,et al.  Application of Data Mining in Customer Relationship Management , 2010, 2010 International Conference on Management and Service Science.

[4]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[5]  Geoffrey I. Webb,et al.  K-Optimal Rule Discovery , 2005, Data Mining and Knowledge Discovery.

[6]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[7]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.