基于散列布尔矩阵的关联规则Eclat改进算法

Improvement of Eclat algorithm for association rules based on hash Boolean matrix

将散列表与布尔矩阵相结合,提出了一种基于散列布尔矩阵的Eclat改进算法,通过提高求交集的速度来加快整个算法生成频集的过程。实验结果表明,改进的Eclat算法在计算性能和时间效率上均优于传统算法。

Taking the hash table with a combination of Boolean matrix,this paper proposed an improvement of Eclat algorithm for association rules based on hash Boolean matrix,by increasing the intersection speed of the algorithm to speed up the process of frequent set.The experimental result demonstrates that the improved Eclat algorithm in the calculation of performance and time efficiency are superior to the traditional algorithm.