By Topic

A new fast algorithm for constructing FP_tree

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
$31 $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

4 Author(s)
Zhenzhou Wang ; Coll. of Electr. Eng., North China Electr. Power Univ., Baoding ; Jiaomin Liu ; Sheng Guo ; Lijuan Yang

FP-tree is an efficient algorithm for generating frequent item-sets and the present algorithms are all based on FP_tree generally. But the FP_treepsilas generative process needs much time and it needs to scan database twice. In order to improve the efficiency of constructing the FP_tree, a new fast algorithm called Level FP_tree (abbreviate L-FP_tree) was proposed. The algorithm contains two main parts. Firstly, it scans database and generates equivalence classes of each item. Secondly, it deletes the non-frequent items and rewrites the equivalence classes and then constructs the L-FP_tree.

Published in:

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Date of Conference:

25-27 June 2008