一种频繁项目集的快速挖掘算法

A Fast Mining Algorithm of Frequent Itemsets

关联规则是当前数据挖掘研究的主要领域之一,发现频繁项目集是关联规则数据挖掘中的关键问题。文章提出了一种快速挖掘频繁项目集的新方法FMFI(FastMiningFrequentItemsets)。针对关联规则下频繁项目集的特性,该算法摆脱了传统的自底向上的搜索策略,而采取了自底向上和自顶向下相结合的双向搜索方式,从而降低了扫描数据库的次数,提高了挖掘效率。

Association rule is one of the main research fields in data mining.Discovering frequent itemsets is a key problem in data mining association rules.A new method FMFI of fast mining frequent itemsets is proposed.To the properties in the frequent itemsets of the association rule,it combines the top-down and the bottom-up into a two-way search mode without the search strategies in the bottom-up traditional method.The algorithm can decrease greatly the number of times in the scanning DB and increase the mining efficiency.