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 paper proposes a fast algorithm DMFP and an updating algorithm IUMFP, which are based on Prefix Tree for mining maximum frequent patterns.
因此，文章提出了一种最大频繁模式的快速挖掘算法DMFP及更新算法IUMFP。
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.
提出了一种可直接用于快速频繁模式挖掘的频繁项目表的概念，并实现了具体的频繁模式增量挖掘方法。
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.
针对数据集中离群数据的挖掘速度的问题，提出了快速的基于单元格的离群数据挖掘算法。
Under this kind of situation, a data mining algorithm EA(efficient algorithm) is proposed, which can fast calculate the confidence in association rules, it soluted the question how to efficient mi…
针对这种情况，提出了一种高效关联规则的挖掘算法EA，解决了在挖掘关联规则过程中如何高效挖掘满足最小置信度的关联规则问题。
Under this kind of situation, a data mining algorithm EA(efficient algorithm) is proposed, which can fast calculate the confidence in association rules, it soluted the question how to efficient mi…
针对这种情况，提出了一种高效关联规则的挖掘算法EA，解决了在挖掘关联规则过程中如何高效挖掘满足最小置信度的关联规则问题。
应用推荐