计算机工程与应用2011，Vol.47Issue(18)：142-145,4.DOI:10.3778/j.issn.1002-8331.2011.18.041
一种定位子集的自顶向下挖掘算法研究
Research of top-down mining algorithm based on orientation subset
摘要
Abstract
Aiming at disadvantage of presented top-down mining algorithm that has redundant computing when non-frequent itemsets generate their subsets and prune some repeatedly generated subsets,an algorithm of top-down mining based on orientation subset is proposed,which is suitable for mining relative long fiequent itemsets. The algorithm uses orientation subset to generate subsets of non-frequent itemsets by top-down strategy,which can efficiently prune redundant subsets and reduce repeatedly computing to improve its efficiency. Comparing with presented top-down mining algorithms,the experiments indicate that it is fast and efficient.关键词
定位子集/自顶向下/长频繁项目集/挖掘算法Key words
orientation subset/top-down/long frequent itemsets/mining algorithm分类
信息技术与安全科学引用本文复制引用
方刚,涂承胜,熊江..一种定位子集的自顶向下挖掘算法研究[J].计算机工程与应用,2011,47(18):142-145,4.基金项目
重庆市教委科技项目(No.KJ091108). （No.KJ091108）
