一种基于事务压缩的关联规则优化算法

Improved algorithm of mining association rules based on reducing transaction

通过对Apriori算法挖掘过程进行分析,提出了一种基于事务压缩的关联规则挖掘算法。该算法充分利用Apriori性质,通过减少候选集的组合和减少数据库的扫描来提高挖掘的速度和减少数据库的I/O操作时间的开销,有效提高了关联规则的挖掘效率。并在Apriori算法的基础上设计了Apriori改进算法。

With the aid of the analysis of mining association rules, a method of mining association rules based on reducing transaction is proposed, which makes best use of property of Apriori. Its main idea is to reduce the number of candidate items and to reduce the times of database scanning. The solution is available. It upgrades the speed of data mining and decreases computer＇s I/O operation. It＇s proved to be more efficient than the traditional method.