最大频繁项集挖掘算法综述

关联规则挖掘是近年来数据挖掘领域中一个相当活跃的领域,频繁项集挖掘是关联规则挖掘中最重要的任务。最大频繁项集的规模远远小于频繁项集的规模,通过最大频繁项集可以导出所有的频繁项集,因此进行了很多专门挖掘最大频繁项集的研究。给出了关联规则和相关术语的基本概念,对最大频繁项集挖掘算法作了分析与评价,便于研究者对已有的算法进行改进,提出具有更好性能的新算法。

Survey of Algorithms for Mining Maximal Frequent Itemsets

Mining association rules is quite an active field in the research of data mining in recent years,and mining frequent itemsets is the most important task of mining association rules.The scale of maximal frequent itemsets is much less than the scale of frequent itemsets,and all frequent itemsets can be educed from maximal frequent itemsets,so researchers do much work for mining maximal frequent itemsets specially.It presents that the definitions of association rule and relative terms,and simply surveys that the algorithms of max frequent itemsets mining and its incremental mining to provide a basis for for improving old algorithms or developing new effective ones.