By Topic

Fast mining maximal frequent itemsets based on Sorted 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

3 Author(s)
Junrui Yang ; Dept. of Comput. Sci., Xian Univ. of Sci. & Technol., Xian ; Yunkai Guo ; Nanyan Liu

In order to improve the efficiency of mining maximal frequent itemsets, a new algorithm SFP-Miner based on Sorted FP-Tree(SFP-Tree) was proposed. The algorithm scanned the database twice and generated the SFP-Tree first, then mined maximal frequent itemsets by depth-first method and directly in SFP-Tree by merging sub-trees, finally obtained the maximal frequent itemsets. The experimental results indicate that SFP-Miner is an efficient algorithm. It has superior to the algorithm Mafia in performance.

Published in:

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

Date of Conference:

25-27 June 2008