基于改进的FP-tree关联规则挖掘算法研究(IJEM-V2-N5-10).pdfVIP

I.J. Engineering and Manufacturing, 2012, 1, 69-77 Published Online October 2012 in MECS () DOI: 10.5815/ijem.2012.05.10 Available online at /ijem Research of Association Rule Mining Algorithm Based on Improved FP-Tree a a a a Chen zhuo , Lu nannan , Li shiqi , Han tao a Hubei University of Technology, Wuhan 430068,China Abstract Mining algorithm of FP-Tree is one of the most effective mining algorithms in association rule mining. It must produce large amounts of the candidate set and scan database repeatedly, but it generates conditional FP- Tree recursively in the process of mining frequent pattern and wastes the storage space greatly using the common trees memory structure. It proposed an algorithm for mining frequent patterns by constructing reverse FP-tree with a binary tree storage structure. In mining process, it mines left son tree recursively, but gets frequent pattern not by generating conditional FP-Tree, so it greatly reduces the storage space and running time. The experiments show that the improved algorithm can realize effective mining on the time and space. Index Terms: data mining; frequent pattern; FP-tree; binary tree © 2012 Published by MECS Publisher. Selection and/or peer review under responsibility of the Research Association of Modern Education and Computer Science. 1. Introduction The improvement technology of data mining promoted the rapid development of data mining. Association rule mining is the most commonly used and important research direction in data mining. Associatio