因此，文章提出了一种最大频繁模式的快速挖掘算法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.
针对一类常见而简单的规则中有项或缺项的约束，提出了一种基于事务数据修剪的约束关联规则的快速挖掘算法。
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.
设计了基于加权快速聚类的异常数据挖掘算法，以便能快速发现异常数据。
This article promoted outlier data mining algorithms based on weighted fast clustering to inspect and deal with outlier data effectively.
面对数据的海洋，传统的单机串行算法己经不能适应快速、实时的知识需求，研究面向多机、并行、分布式的数据挖掘模型越来越重要。
The traditional serial algorithm can't do work well for the data ocean quickly and correctly, it also important to research the parallel algorithm.
实验证明，与现有的自顶向下挖掘算法相比，该算法是快速而有效的。
Comparing with presented top-down mining algorithms, the experiments indicate that it is fast and efficient.
针对频繁闭项集挖掘算法中数据结构与处理机制复杂的问题，提出窗口快速滑动的数据流频繁闭项集挖掘算法——MFWSR。
This paper proposes an algorithm of Mining Frequent closed itemsets with Window Sliding Rapidly(MFWSR) against the complexity of data structure and process for determination.
针对数据集中离群数据的挖掘速度的问题，提出了快速的基于单元格的离群数据挖掘算法。
The speed of mining outliers from dataset is slow. According to the characteristic of grid, fast outliers mining algorithm was proposed by partitioning the data into a set of units cell firstly.
通过对二维空间数据测试表明，改进的算法能够快速有效地挖掘出数据集中的离群数据，速度上数倍于原来的算法。
Experimental results show that the improved algorithm is effective and efficient in outlier mining and it is faster than the original algorithm.
通过对二维空间数据测试表明，改进的算法能够快速有效地挖掘出数据集中的离群数据，速度上数倍于原来的算法。
Experimental results show that the improved algorithm is effective and efficient in outlier mining and it is faster than the original algorithm.
应用推荐