除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。

In addition, we add a bit string to each node in the tree to store the prefix of the items. By using the structure we can avoid repeatedly traversing the sub-tree while expanding the patterns.

youdao

该算法通过对模式树的各种操作简化了对频繁项集的搜索过程。

To make further improvement on the scalability of the algorithm, we make a further study on the pattern tree, and propose a new algorithm called FP-DFS based on the study.

youdao