基于频繁模式树的快速关联规则挖掘算法.pdf

（ ） — JournaI of Southeast University EngIish Edition VoI . 19 No .4 Dec . 2003 ISSN 1003 7985 Fast FP-Growth for association rule mining ， Yang Ming1 2 Yang Ping3 Ji genIin2 Sun Zhihui2 1 （ ， ， ， ） Department of Computer Science and Engineering Auhui University of TechnoIogy and Science Wuhu 241000 China 2 （ ， ， ， ） Department of Computer Science and Engineering Southeast University Nanjing 210096 China 3 （ ， ， ， ） Department of Mathematics and Physics Anhui University of TechnoIogy and Science Wuhu 241000 China Abstract ： ， ， （ ）， In this paper we propose an efficient aIgorithm caIIed FFP-growth short for fast FP-growth to mine freguent ， ， itemsets . SimiIar to FP-growth FFP-growth searches the FP-tree in the bottom-up order but need not construct conditionaI ， ， ， pattern bases and sub-FP-trees thus saving a substantiaI amount of time and space and the FP-tree created by it is much smaIIer than that created by TD-FP-growth，hence improving efficiency . At the same time，FFP-growth can be easiIy