用于挖掘关联规则的事务序列合并算法

Efficient Transaction Sequence Amalgamated Algorithm for Mining Association Rules

针对Apriori和FP-增长算法存在的需要进行大量数据处理的问题,采用合并事务的思想改进这两种算法。提出一种合并事务的算法缩减事务的总量,并给出两种有效的挖掘关联规则的合并算法。

The idea of amalgamating transactions to improve the Apriori and FP-growth algorithms is introduced in this paper.We present an algorithm for amalgamating transactions in order to reduce the amount of transactions.According to the amalgamated algorithm,we propose two efficient algorithms for mining association rules from the amalgamated transactions.