一种基于二进制编码的频繁项集查找算法

A Algorithm of Finding Frequent Item Sets Based on Binary Coding

在数据挖掘中频繁项集的查找时间是影响挖掘关联规则效率的关键因素,Apriori算法是用来找出频繁项集的典型算法,本文针对Apriori算法需反复扫描数据库、产生大量候选项集的不足,提出一种效率更高的基于二进制编码的频繁项集查找算法,该算法找出频繁项集只需一次数据库扫描,不产生候选项集,与Apriori算法相比,算法效率更高。

This paper puts forward a new method to find frequent item sets. The excellence of method to compare with Apriori algorithm, this method only need once scans to database, further more, it do not generate the candidate item sets, we can find frequent items more effectively.