您要查找的是不是：
- 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算法。
- maximal frequent itemset 最大频繁项集
- A Depth-First Search Algorithm for Mining Maximal Frequent Itemsets 一种挖掘最大频繁项集的深度优先算法
- The problem of fuzzy constraint in frequent itemset mining is studied. 摘要研究频繁项集挖掘中的模糊约束问题。
- maximal frequent itemsets 最大频繁项集
- Grahne G,Zhu Jian-fei.Fast algorithms for frequent itemset mining using FP-Trees[J].IEEE Transactions on Knowledge and Data Engineering,2005,10:1347. 胥桂仙;高旭;于绍娜;关联规则算法在中文文本挖掘中的应用研究[J].;中央民族大学学报;2004;13(4):332-338
- 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充分利用位图的字节特性，优化了项集的匹配和合并操作，并首次在其中引入了基于局部最大频繁项集的超集存在判断方法。
- 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. 其次，给出了加权最大频繁子图的定义，不仅可以找出较为重要的最大频繁子图，而且可以使挖掘结果同样具有反单调性，从而可加速剪枝。
- Maximal Frequent Path (MFP) method 最大频繁访问路径方法
- maximal frequent item sequence sets 最大频繁项目序列集
- maximal frequent item set mining 最大频繁项集挖掘
- The famous algorithms to find the frequent itemsets include Apriori and FP-growth. 经典的生成频繁项目集集合的算法包括Apriori算法和FP-growth算法。
- maximal frequent patterns itemsets 最大频繁集
- Discovering frequent itemsets is a key problem in data mining association rules. 发现频繁项目集是关联规则数据开采中的关键问题。
- Discovering maximum frequent itemsets is a key problem in many data mining applications. 发现最大频繁项目集是多种数据开采应用中的关键问题 .
- maximal frequent sequential pattern 最大频繁序列模式
- The HCM sketch uses breadth-first search strategy to identify and evaluate the hierarchical frequent itemsets. 基于该结构,利用广度优先查询策略,查找多层频繁项集和估计多层频繁项值。
- weighted maximal frequent subgraph 最大加权频繁子图
- In data mining,IUA algorithm has a problem that the frequent itemsets are not minined completely. 在关联规则挖掘中,对所挖掘出的关联规则的管理和维护非常重要。
