Advertisement
Published in:
2011 | OriginalPaper | Chapter
Improved Algorithm for Mining N-Most Interesting Itemsets
Authors : Xiaohong Cui, Jihai Xiao, Junjie Chen, Lijun Sang
Published in: Emerging Research in Artificial Intelligence and Computational Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
BOMO algorithm constructs conditional FP-Tree recursively so that it requires more memory and CPU resources. To solve this problem, an algorithm for mining N-most interesting itemsets based on COFI-Tree is presented. This algorithm adopts COFI-Tree. COFI-Tree doesn’t need to construct conditional FP-Tree recursively and there is only one COFI-Tree in memory at a time. Experiment shows that (1) the new algorithm based on COFI-tree performs faster than current best algorithm BOMO;(2) the algorithm has good performance for large data set, especially it shows the best when for k value is smaller than 4.