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

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

youdao

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

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 article promoted outlier data mining algorithms based on weighted fast clustering to inspect and deal with outlier data effectively.

youdao