收稿日期: 2003-06-11
修回日期: 2004-03-22
网络出版日期: 2004-05-10
基金资助
supported by National High tech R&D Plan( 863CIMS2001AA414210,2003AA413021) and NNSF (70171043)
Fast Association Rule Mining in CRM
Received date: 2003-06-11
Revised date: 2004-03-22
Online published: 2004-05-10
王扶东 , 李洁 , 薛劲松 , 朱云龙 . 关联规则快速挖掘在CRM中的应用(英文)[J]. 中国科学院大学学报, 2004 , 21(3) : 358 -365 . DOI: 10.7523/j.issn.2095-6134.2004.3.012
The analysis of cross selling is one of the important parts in analytical CRM. We present a constraint based association rules mining algorithm AApriori with the specified antecedent and the constrained consequent. The outcome of this algorithm can help enterprises use selling products to popularize products that are unpopular. At the same time, an algorithm CApriori that the consequent is specified and the antecedent is constraind is presented. It can effectively support enterprises to exploit the market of new products. The evaluation demonstrated that the algorithm AApriori and CApriori could quickly get exact information that the enterprise wants.
Key words： data mining; association rule; CRM
[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
/
| 〈 |
|
〉 |
