By Topic

An Efficient Algorithm for Discovering Maximum Length Frequent Itemsets

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)
Tran Anh Tai ; Sch. of Inf. & Commun. Technol., Hanoi Univ. of Sci. & Technol., Hanoi, Vietnam ; Ngo Tuan Phong ; Nguyen Kim Anh

The exploitation of frequent itemsets has been restricted by the the large number of generated frequent itemsets and the high computational cost in real world applications. Meanwhile, maximum length frequent itemsets can be efficiently discovered on very large datasets and are useful in many application domains. At present, LFIMiner_ALL is the fastest algorithm for mining maximum length frequent itemsets. Exploiting the optimization techniques in LFIMiner_ALL algorithm, we develop the MaxLFI algorithm to discover maximum length frequent itemsets by adding our conditional pattern base pre-pruning strategy and evaluating initial length of maximum length frequent itemsets to prune the search space. Experimental results on real-world datasets show that our proposed algorithm is faster than LFIMiner_ALL algorithm for mining maximum length frequent itemsets.

Published in:

Knowledge and Systems Engineering (KSE), 2011 Third International Conference on

Date of Conference:

14-17 Oct. 2011