Aiming at a familiar and simple constraint that some items must or must not present in rules, a fast clipped-transaction-based constraint association-rule mining algorithm was put forward.

针对一类常见而简单的规则中有项或缺项的约束，提出了一种基于事务数据修剪的约束关联规则的快速挖掘算法。

youdao

This paper proposes a fast algorithm DMFP and an updating algorithm IUMFP, which are based on Prefix Tree for mining maximum frequent patterns.

因此，文章提出了一种最大频繁模式的快速挖掘算法DMFP及更新算法IUMFP。

youdao

Based on a new idea of frequent item table which can be directly used in fast frequent mode mining, an effective FP_growth mining algorithm is presented in this paper.

提出了一种可直接用于快速频繁模式挖掘的频繁项目表的概念，并实现了具体的频繁模式增量挖掘方法。

youdao