一种改进的Eclat算法

An Improved Eclat Algorithm

提出一种改进的Eclat算法。该算法在垂直数据表示方式上执行广度优先搜索和交叉计数。新算法充分利用了垂直数据表示和交叉计数的高效优势,以及Apriori算法的剪枝策略,减少了计数的候选项集的数量。实验结果表明,改进的Eclat算法的运行速度较Eclat算法有了明显的提高。

A new improved association rule algorithm is proposes based on Eclat. The new algorithm is implemented by vertical data layout, breadth first search, and intersection. It makes use of the efficiency of vertical data layout and intersection, and prune candidate frequent item sets like Apriori. The new algorithm against Eclat, making significant progress in runtime on our test database experimentally compared.