Weighted Frequent Itemset Algorithm Based on Dynamic Itemset Counting

The existing weighted frequent itemset mining algorithms which are based on Apriori require multiple dataset scans.This paper proposes a weighted frequent itemset algorithm weighted frequent itemset mining based on dynamic itemset counting which uses the structure of weighted trie tree and the method of dynamic itemset counting.This algorithm satisfies the downward closure property and dynamically generates candidate frequent itemsets,thereby reduces the number of scanning datasets and improves the performance.Experimental results show that the proposed algorithm not only generates the weighted frequent itemsets,but also has high efficiency and time performance.