By Topic

A non-recursive approach for FP-tree based frequent pattern generation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jalan, S. ; ABV-Indian Inst. of Inf. Technol. & Manage., Gwalior, India ; Srivastava, A. ; Sharma, G.K.

Generation of frequent patterns is an important component of association rule mining. FP-tree and P-tree are two efficient algorithms for the purpose, requiring two and one scan of database to generate the compact data structures Frequent Pattern-tree and Pattern-tree, respectively. P-tree algorithm restructures the P-tree and creates FP-tree. Both the algorithms further, use a recursive mining process to generate frequent patterns from FP-tree. In this paper, a new approach is bottom-up scanning. Next, it uses a highly efficient non-recursive procedure to generate frequent patterns. This new approach has been compared with two algorithms FP-growth and P-tree and has been found to be better in terms of performance.

Published in:

Research and Development (SCOReD), 2009 IEEE Student Conference on

Date of Conference:

16-18 Nov. 2009