基于FP-tree的支持度计数优化策略OACSTPCD

In the association rules mining,mining frequent itemsets is the most critical step. Maximum frequent itemsets is the most com-mon simplified representation of frequent itemsets. Maximum frequent itemsets mining algorithms based on FP-tree are most needed to search the FP-tree bottom-up to count the support of the itemsets,but they have not considered the information obtained by completed support counting while counting the current itemset,resulting in unnece…查看全部>>