您要查找的是不是：
- Using frequent pattern tree,it divides and rules the alarms during the clustering process. 然后举例说明了利用该算法进行聚类的过程。
- 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 子树的规模;减少了遍历的开销.
- Mining frequent pattern tree in Web data Web数据中频繁模式树的挖掘
- 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,它能适应数据流的特点并且可以挖掘数据流频繁闭项集信息。
- Algorithm for Mining Negative Association Rules Based on Frequent Pattern Tree 基于频繁模式树的负关联规则挖掘算法
- Algorithm for Mining Constrained Maximum Frequent Itemsets Based on Frequent Pattern Tree 基于频繁模式树的约束最大频繁项目集挖掘算法研究
- An Algorithm and Its Updating Algorithm Based on Frequent Pattern Tree for Mining Constrained Maximum Frequent Itemsets 一种基于频繁模式树的约束最大频繁项目集挖掘及其更新算法
- Constrained Frequent Pattern (FP) Tree 约束FP树
- frequent pattern tree 频繁模式树
- Frequent Pattern tree(FP-tree) 频繁模式树
- frequent pattern tree algorithm FP-增长树方法
- Results of the analysis performed on the editorials indicated that the most frequent pattern pertaining to all the studied newspapers was LFV. “一样的花费，更好的质量和服务”，这是新华翻译社对客户的承诺。
- FP-DFS simplifies the mining processes through applying various operations on Pattern tree. 该算法通过对模式树的各种操作简化了对频繁项集的搜索过程。
- Furthermore, we present two pattern sanitization algorithms for blocking inference channels in frequent pattern sharing, and evaluate their performance in the experiments. 然后，基于模式净化的思路，提出了两个推理控制算法，并通过实验对算法的性能进行了比较分析。
- Since it lays groundwork for other problem and its intrinsic complexity, the algorithm for frequent pattern miming has become the focus of many research workers. 由于问题本身的基础性和内在复杂性，频繁模式挖掘方法成为许多研究者关注的课题。本文对频繁模式挖掘相关技术进行了研究。
- To make further improvement on the scalability of the algorithm, we made a further study on the Pattern tree, and proposed a new algorithm called FP-DFS based on the study. 为了进一步提高频繁项集挖掘算法的可扩展性，本文对模式树进行了细致的研究，在此基础上提出了一种挖掘频繁项集的新算法，FP-DFS算法。
- 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. 实验结果表明，该算法是一个高效的基于图遍历的加权频繁模式挖掘算法。
- The main work in this part is to extend the DTD constraints SC(sibling constraints) to be ESC(extended sibling constraints), and propose a PTIME algorithm for XML pattern tree minimization under ESC constraints. 主要工作是将DTD约束SC扩展为ESC，并提出了一个ESC下的多项式时间的XML模式树最小化算法。
