Application in Market Basket Research Based on FP-Growth Algorithm
暂无分享,去创建一个
[1] Dimitris Kanellopoulos,et al. Association Rules Mining: A Recent Overview , 2006 .
[2] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[3] Petra Perner,et al. Data Mining - Concepts and Techniques , 2002, Künstliche Intell..
[4] Jian Pei,et al. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).
[5] Tang Chang-jie,et al. An Improved Algorithm Based on Maximum Clique and FP-Tree for Mining Association Rules , 2004 .
[6] Gong Ai-guo. New algorithms for effectively creating conditional pattern bases of FP-Tree , 2006 .
[7] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[8] Gregory Piatetsky-Shapiro,et al. Advances in Knowledge Discovery and Data Mining , 2004, Lecture Notes in Computer Science.
[9] Chen An. An Improved Algorithm Based on Maximum Clique and FP-Tree for Mining Association Rules , 2004 .
[10] Shi Zhongzhi,et al. SFP-Max—A Sorted FP-Tree Based Algorithm for Maximal Frequent Patterns Mining , 2005 .
[11] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.