计算机工程2013，Vol.39Issue(4)：219-221,225,4.DOI:10.3969/j.issn.1000-3428.2013.04.050
基于父子等价剪枝策略的最大频繁项集挖掘
Maximal Frequent Itemset Mining Based on Parent-child Equivalency Pruning Strategy
摘要
Abstract
Incomplete pruning leads to inefficiencies for the search space with the same transaction set in parent-child node according to the traditional pruning strategy.This paper presents a parent-child equivalency pruning strategy which can prune the search space with the same transaction set in parent-child node.It effectively minimizes the search space and reduces the number of frequent items.The new maximal frequent itemset mining algorithm is completed based on new pruning strategy.Experimental results show that the new pruning strategy can shorten the time of mining maximal frequent itemset with the same support.关键词
数据挖掘/最大频繁项集/剪枝策略/最小支持度/深度优先/关联规则Key words
data mining/ maximum frequent itemset/ pruning strategy/ minimum support/ depth-first/ association rule分类
信息技术与安全科学引用本文复制引用
张志刚,黄刘生,金宗安,项莉萍..基于父子等价剪枝策略的最大频繁项集挖掘[J].计算机工程,2013,39(4):219-221,225,4.基金项目
安徽省高等学校自然科学研究基金资助项目(KJ2012B181) （KJ2012B181）
