基于树结构的高效关联规则挖掘算法*

关联规则挖掘过程中，大量候选项集的产生成为影响挖掘效率提高的一个主要因素。针对这一问题，提出了一种基于树结构的关联规则挖掘算法。该算法运用关联矩阵将频繁项集映射到树结构中存储，并利用树中包含部分频繁项集的子树，逐步拓展成包含所有频繁项集的树结构；其不仅提高了候选项集的生成效率，而且极大地减少了候选项集的产生数量。实验证明，该算法相比同类算法是快速有效的。

High efficiency algorithm based on tree for mining association rules

In the process of association rules mining, the main factor of influencing the mining efficiency is that a large number of candidate items are came into being. For solve this problem,proposed an association mining algorithm bases on tree. This algorithm makes the frequent items storage into tree structure through association matrix, and takes advantage of the parts of the frequent item in the tree building the tree including the whole frequent items. This algorithm not only improves candidate items producing efficient, but also reduces the number of the candidate items. The experiment prove that this algorithm is faster and more efficient than other similar algorithm.