您要查找的是不是：
- maximal frequent patterns itemsets 最大频繁集
- maximal frequent patterns 最大频繁模式
- maximal frequent pattern 最大频繁模式
- maximal frequent sequential pattern 最大频繁序列模式
- At last, our experimental result shows that the algorithm FIMA is more effectively than the algorithm DLG based on graph for mining frequent patterns. 试验结果表明该算法比同样基于逻辑与运算的DLG算法挖掘频繁项集的效率更高。
- Experimental results showed that GGTWFPMiner was an effective weighted frequent patterns mining algorithm based on graph traversals. 实验结果表明，该算法是一个高效的基于图遍历的加权频繁模式挖掘算法。
- It proposed an algorithm for mining frequent patterns by finding the frequent extensions and merging sub-trees in a conversely constructed FP-tree. 摘要提出了一种称为逆向FP-合并的算法，该算法逆向构造FP-树并通过在其中寻找频繁扩展项集与合并子树来挖掘频繁模式。
- By utilizing the byte characteristic, DFMfi can optimize the mapping and unifying operations on the item sets. Moreover, for the first time a method based on bitmap which uses local maximal frequent item sets for fast superset checking is employed. 算法DFMfi充分利用位图的字节特性，优化了项集的匹配和合并操作，并首次在其中引入了基于局部最大频繁项集的超集存在判断方法。
- Based on this model, a new algorithm called Global Graph Traversals-based Weighted Frequent Patterns Miner (GGTWFPMiner) was presented. 基于该模型，提出了基于全局图遍历加权频繁模式挖掘算法。
- Secondly，weighted maximal frequent subgraph is defined，which can not only discover important maximal subgraph，but also inherit the property of anti-monotony.Thus，the speed of pruning is quickened. 其次，给出了加权最大频繁子图的定义，不仅可以找出较为重要的最大频繁子图，而且可以使挖掘结果同样具有反单调性，从而可加速剪枝。
- This paper presents ESEquivPS extension support equivalency pruning strategy, a new search space pruning strategy for mining maximal frequent itemsets to effectively reduce the search space. 为了有效地削减搜索空间,提出了一种新的最大频繁项集挖掘中的搜索空间剪枝策略。
- The characteristics of effective access sequence in the actual application are analyzed and an efficient algorithm OUS based bottom-up strategy is proposed for mining maximal frequent itemsets. 分析实际应用中有效访问序列的特点,提出了一种采用自底向上策略快速挖掘最大频繁项集的OUS算法。
- Using frequent pattern tree,it divides and rules the alarms during the clustering process. 然后举例说明了利用该算法进行聚类的过程。
- Results of the analysis performed on the editorials indicated that the most frequent pattern pertaining to all the studied newspapers was LFV. “一样的花费，更好的质量和服务”，这是新华翻译社对客户的承诺。
- In order to overcome the disadvantage of low efficiency of KM-AOI algorithm,an AOI clustering algorithm based on frequent pattern tree is presented. 为了克服KM-AOI算法聚类效率较低的缺点,提出了基于频繁模式树的AOI聚类算法,即在聚类过程中借助频繁模式树,采取分而治之的策略处理警报集以得到规则。
- In addition, FPMFI also compresses the conditional FP-Tree (frequent pattern tree) greatly by deleting the redundant information, which can reduce the cost of accessing the tree. 另外;算法FPMFI通过删除FP子树(conditional frequent pattern tree)的冗余信息;有效地压缩了 FP 子树的规模;减少了遍历的开销.
- Maximal Frequent Path (MFP) method 最大频繁访问路径方法
- Then, this paper proposed an increment update algorithm TW-CFI based on frequent pattern trees and sliding windows.This algorithm adapted the characteristics of data streams. 然后,基于频繁模式树,结合滑动窗口技术提出了一种增量更新算法TW-CFI,它能适应数据流的特点并且可以挖掘数据流频繁闭项集信息。
- maximal frequent item sequence sets 最大频繁项目序列集
- Furthermore, we present two pattern sanitization algorithms for blocking inference channels in frequent pattern sharing, and evaluate their performance in the experiments. 然后，基于模式净化的思路，提出了两个推理控制算法，并通过实验对算法的性能进行了比较分析。
