计算机技术与发展2017，Vol.27Issue(10)：30-33,38,5.DOI:10.3969/j.issn.1673-629X.2017.10.007
基于FP-tree的支持度计数优化策略
Support Count Optimization Method Based on FP-tree
摘要
Abstract
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 unnecessary overhead. To solve it,Support Count Optimization Method on FP-tree,called SCOM for short,is proposed. With a small additional space cost,it can make full use of the information that whether a path supports a itemset and the relation between the itemsets to prune the search. Experimental results show that the maximum frequent itemsets mining algorithm applied obtains a performance boost with SCOM which optimizes the support count based on FP-tree,so it can be applied to all algorithms that use FP-tree to count support.关键词
关联规则挖掘/FP-tree/最大频繁项集/支持度计数/搜索剪枝Key words
association rules mining/FP-tree/maximum frequent itemsets/support count/search prune分类
信息技术与安全科学引用本文复制引用
赵阳,白凡..基于FP-tree的支持度计数优化策略[J].计算机技术与发展,2017,27(10):30-33,38,5.基金项目
国家科技重点专项"核高基"(2015ZX01040-201) （2015ZX01040-201）
