基于间接关联规则的数据挖掘算法研究 关键词：间接关联；FP树；数据挖掘 [gap=944]Key words：indirect association；FP-tree；data mining
基于28个网页-相关网页
FP tree FP树
frequent pattern tree fp-tree 频繁模式树
FP-tree method 频繁模式树算法
merged FP-tree 合并FP树
sort condition FP-tree 排序条件频繁模式树
frequent pattern tree fp tree 频繁模式树
FP binary sorting tree FP二叉排序树
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算法相比，该算法具有更好的效率。
应用推荐