您要查找的是不是：
- 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 一种基于频繁模式树的约束最大频繁项目集挖掘及其更新算法
- Maximum Frequent Pattern 最大频繁模式
- Discovering maximum frequent itemsets is a key problem in many data mining applications. 发现最大频繁项目集是多种数据开采应用中的关键问题 .
- In this paper，a new kind of algorithms BFI-DMFI（Mining Maximum Frequent Itemsets） and BFI-DCFI（Mining Frequent Closed Itemsets） is proposed. 摘要 提出了基于频繁项集的最大频繁项集（BFI-DMFI）和频繁闭项集挖掘算法（BFI-DCFI）。
- Using frequent pattern tree,it divides and rules the alarms during the clustering process. 然后举例说明了利用该算法进行聚类的过程。
- In BFI-DMFI，we can confirm whether a frequent itemsets is also a maximum frequent itemsets through detecting whether exiting their superset itemsets in frequent itemsets. BFI-DMFI算法通过逐个检测频繁项集在其集合中是否存在超集确定该项集是不是最大频繁项集；
- Results of the analysis performed on the editorials indicated that the most frequent pattern pertaining to all the studied newspapers was LFV. “一样的花费，更好的质量和服务”，这是新华翻译社对客户的承诺。
- The MFIA_VTL algorithm finds maximum frequent itemsets through partitioning itemsets search space based on the prefix in the database with the vertical tid-list of transactions. 该算法针对数据库的垂直事务标识列表结构对项集搜索空间进行基于前缀的划分，来发现最大频繁项集。
- 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 BFI-DCFI，in order to generate frequent closed itemsets，we can make use of mining maximum frequent itemsets from frequent itemsets which have equal support. BFI-DCFI算法则是通过挖掘所有支持度相等的频繁项集中的最大频繁项集组合生成频繁闭项集。
- 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 子树的规模;减少了遍历的开销.
- 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,它能适应数据流的特点并且可以挖掘数据流频繁闭项集信息。
- 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. 由于问题本身的基础性和内在复杂性，频繁模式挖掘方法成为许多研究者关注的课题。本文对频繁模式挖掘相关技术进行了研究。
- For reducing the spaces of rule database and facilitating users to query,the minimal prediction set is used and mined using maximum frequent item sets which are found by a set-enumeration tree. 为缩减关联规则存储空间和方便查询关联规则,提出一种前件为单一项目的最小预测集算法。
- The natural balance in with prey and predator have be increasingly disturbed，maximum frequently by human intervention. 在捕食者和捕猎者之间的平衡被日益扰乱，最经常的是由于人的干涉。
- Next, after near 10 years research and development, the most essential phase in association rules mining, frequent pattern acquirement, and its techniques have been improved dramatically. 其次，在经历了近10年的发展以后，关联规则挖掘中至关重要的频繁模式获取技术得到了很大的发展。
- This suggests those cartoons maximum frequently teach child the difference in with good and evil . 这说明卡通在大多数情况下教授给儿童好与坏之间的区别。
- 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算法挖掘频繁项集的效率更高。
