An Efficient Frequent Patterns Mining Algorithm Based on Apriori Algorithm and the FP-Tree Structure

Authors:
Bo Wu;Defu Zhang;Qihua Lan;Jiemin Zheng
Affiliations:
-;-;-;-
Venue:
ICCIT '08 Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 01
Year:
2008

Citing 0
Cited 2

An improved Apriori-based algorithm for association rules mining

FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
An innovative routing algorithm with reinforcement learning and pattern tree adjustment for wireless sensor networks

ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Association rule mining is to find association relationships among large data sets. Mining frequent patterns is an important aspect in association rule mining. In this paper, an efficient algorithm named Apriori-Growth based on Apriori algorithm and the FP-tree structure is presented to mine frequent patterns. The advantage of the Apriori-Growth algorithm is that it doesn't need to generate conditional pattern bases and sub- conditional pattern tree recursively. Computational results show the Apriori-Growth algorithm performs faster than Apriori algorithm, and it is almost as fast as FP-Growth, but it needs smaller memory.