[1] Barnes J G. Secrets of customer relationship management. McGraw Hill Education, 2001

[2] Alex Berson, Stephen Smith, Kurt Thearling. Building data mining applications for CRM. McGrawHill Education, 1999

[3] R Agrawal, T Imielinski, A Swami. Mining association rules between sets of items in large database. In: Proceeding of the 1993 ACM2SIGMOD International Conference on Management of Data. Washington DC, 1993. 207-216

[4] H manila, HToivonen. Efficient algorithms fordiscoveringassociation rules. In: Proceeding ofAAAI Work Shop Knowledge Discovery in database. 1994. 181-192

[5] Jong Soo Park, Ming-Syan Chen. An effective hash-based algorithm for mining association rules. In: Proceeding of the 1995 ACM2SIGMOD International Conference on Management of Data.California, 1995. 175-186

[6] J Han, J Pei. Mining frequent patterns without candidate generation. In: Proc 2000 ACM2SIGMOD Int Conf Management of Data, Dallas, TX,2000. 1-12

[7] R Agrawal, R Srikant. Fast algorithms for mining association rules. In: Proc 20th Int Conf on VLDB. Santiago,DC, 1993. 207-216

[8] Lan H Witten, Eibe Frank. Data mining. San Francisco:Morgan Kaufmann Publishers, 2000

[9] Shi Zhong-Zhi. Knowledge discovery. Beijing:Tsinghua University Press, 2002(In Chinese)

[10] R Srikant, Q Vu. Mining association rules with Item Constraints. In: Proc ofthe Third Int Conf on Knowledge Discovery in Data Bases and Data Mining. 1997.67-73

[11] R T Ng, V S Lakshmanan, J Han, A Pang. Exploratorymining and pruning optimizations of constrained association rules. In: Proc of the 1998 AACM2SIGMOD Int Conf on Management of Data. 1998. 13-24

[12] Roberto J Bayardo Jr, R Agrawal. Constraint2based rule mining in large, dense database. In: Proc ofthe 15th Int Confon Data Engineering. 1999.188-197