摘要： 关联规则是当前数据挖掘研究的主要领域之一。 发现频繁项目集是关联规则数据开采中的关键问题。该文提出了一种基于最大频繁项目集的逆向开采算法IDMFI(inverse discovery maximum frequent itemsets),该算法利用频繁项目集的有关特性作为启发信息,采用逆向(即自顶向下)的搜索策略,能够大大减少候选项目集的生成,从而显著地提高了开采效率。

关键词: 数据开采, 关联规则, 最小支持度, 最大频繁项目集

Abstract: Association rule is one of the main research fields in data mining. Discovering frequent itemsets is a key problem in data mining association rules. In this paper, the IDMFI(inverse discovery maximum frequent itemsets) algorithm which is an inverse data mining method based on maximum frequent itemset is proposed to solve this problem. Using the properties on the frequent itemset as heuristic information and inverse(i.e. top- down) search strategy, the number of candidate itemsets can be greatly decreased, therefore the performance in data mining is improved remarkably.

中图分类号: 

• TP311