Chen zhuo; Lu nannan; Li shiqi; Han tao

International Journal of Engineering and Manufacturing (IJEM)

IJEM Vol. 2, No. 5, 5 Oct. 2012

Cover page and Table of Contents: PDF (size: 117KB)

Research of Association Rule Mining Algorithm Based on Improved FP-Tree

Full Text (PDF, 117KB), PP.69-77

Views: 0 Downloads: 0

Author(s)

Chen zhuo ^1,* Lu nannan ¹ Li shiqi ¹ Han tao ¹

1. Hubei University of Technology, Wuhan 430068,China

* Corresponding author.

DOI: https://doi.org/10.5815/ijem.2012.05.10

Received: 14 Jun. 2012 / Revised: 27 Jul. 2012 / Accepted: 5 Sep. 2012 / Published: 5 Oct. 2012

Index Terms

Data mining, frequent pattern, FP-tree, binary tree

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 FPTree recursively in the process of mining frequent pattern and wastes the storage space greatly using the common tree's 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.

Cite This Paper

Chen zhuo,Lu nannan,Li shiqi,Han tao,"Research of Association Rule Mining Algorithm Based on Improved FP-Tree", IJEM, vol.2, no.5, pp.69-77, 2012. DOI: 10.5815/ijem.2012.05.10

Reference

[1] Van der Geer J, Hanraads JAJ, Lupton RA. The art of writing a scientific article. J Sci Commun 2000;163:51-9.
[2] Strunk Jr W, White EB. The elements of style. 3rd ed. New York: Macmillan; 1979.
[3] HAN J, KAMBER M, Data Mining Concepts and Techniques(in Chinese) [M], Beijing: China Machine Press, 2001.
[4] Fan Ming, Li Chuan, Mining Frequent Patterns in an FP-tree Without Conditional FP-tree Generation(in Chinese) [J], Journal of Computer Research And Development, 2003, 8: 1216 - 1222.
[5] Zhao Yanduo, Song Binheng, Algorithm for mining frequent patterns based on converse FP-tree(in Chinese) [J], Computer Applications, 2005,6:1385- 1387.
[6] Meng Xiangping, Wang Huajin, Wang Xiangyong, Mining Maximal Frequent Patterns Based on Improved FP-Tree(in Chinese) [J], Computer Engineer and application, 2005,14:179- 181.
[7] Liang Bizhen, Lu Yueran,Qin Liangyi,An Improved FP-Tree -Based Algorithm for Maximal Target Frequent Itemsets Mining(in Chinese) [J], Computer Engineer And Science, 2007,10:70- 72.
[8] Ma Xuhui, Zhang Ahong, Association Rules Generated By the FP Tree Depth-First Algorithm(in Chinese)[J], Artificial intelligence and recognition technology, 2010,6: 3439-3440.