After the frequent 1-itemsets is produced, it separately uses them as constraint conditions to construct compact FP-tree and to mine inter-transactional association rules.
算法在产生了频繁1-项集之后，分别利用1-项集中的项作为约束条件，建立压缩FP-树，挖掘跨事务关联规则。
A distinct head list of vertical item is designed to facilitate recoding vertical data, rebuilding transactions, constructing FP-growth tree and updating augment of vertical data.
设计了独特的垂直项目头表独特的存储结构，便于垂直数据的存储、事务的投影、FP树的建立和垂直数据的增量更新。
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.
该算法通过对模式树的各种操作简化了对频繁项集的搜索过程。
Compared with Apriori algorithm and FP-growth algorithm, Combination Tree algorithm has better efficiency.
与Apriori算法和FP - growth算法相比，该算法具有更好的效率。
Compared with Apriori algorithm and FP-growth algorithm, Combination Tree algorithm has better efficiency.
与Apriori算法和FP - growth算法相比，该算法具有更好的效率。
应用推荐