This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 Third International Conference on Knowledge and Systems Engineering
An Efficient Algorithm for Discovering Maximum Length Frequent Itemsets
Hanoi, Vietnam
October 14-October 17
ISBN: 978-0-7695-4567-7
The exploitation of frequent item sets has been restricted by the the large number of generated frequent item sets and the high computational cost in real world applications. Meanwhile, maximum length frequent item sets 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 item sets. Exploiting the optimization techniques in LFIMiner_ALL algorithm, we develop the MaxLFI algorithm to discover maximum length frequent item sets by adding our conditional pattern base pre-pruning strategy and evaluating initial length of maximum length frequent item sets 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 item sets.
Index Terms:
Frequent itemsets, Maximal Frequent itemsets, Maximum length frequent itemsets, FP-tree, Data mining
Citation:
Tran Anh Tai, Ngo Tuan Phong, Nguyen Kim Anh, "An Efficient Algorithm for Discovering Maximum Length Frequent Itemsets," kse, pp.62-69, 2011 Third International Conference on Knowledge and Systems Engineering, 2011
Usage of this product signifies your acceptance of the Terms of Use.