Improvement of Eclat algorithm for association rules based on hash Boolean matrix
基于散列布尔矩阵的关联规则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.