算法在产生了频繁1-项集之后，分别利用1-项集中的项作为约束条件，建立压缩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.
研究发现快速包分类算法EGT-PC由于压缩特里树路径带来规则集的大量冗余备份降低了算法的查找时间和存储空间等性能。
This paper found out the fast packet classification algorithm EGT-PC's search time and storage space performance were decreased by the rules' redundant copies.
应用推荐