To increase the efficiency of sequential combination tree method, it is necessary to make full use of information in the constraint conditions.
为了提高有序组合树法的运算效率,必须充分利用约束条件中的有关信息。
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算法相比,该算法具有更好的效率。
应用推荐