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-树,挖掘跨事务关联规则。
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算法相比,该算法具有更好的效率。
应用推荐