您要查找的是不是：
- Maximal frequent subtree 最大频繁子树
- maximal frequent subtrees 最大频繁Induced子树
- The main contributions of the paper are listed as follows. (1) Discuss the actualities of the recent researches on frequent subtree mining. 论述了各种频繁子树挖掘算法的思想，并对典型算法的性能进行了实验分析与比较。
- 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. 其次，给出了加权最大频繁子图的定义，不仅可以找出较为重要的最大频繁子图，而且可以使挖掘结果同样具有反单调性，从而可加速剪枝。
- 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算法。
- Frequent Subtree Mining Based on Projected Branch 基于投影分支的快速频繁子树挖掘算法
- Maximal Frequent Path (MFP) method 最大频繁访问路径方法
- maximal frequent item sequence sets 最大频繁项目序列集
- maximal frequent item set mining 最大频繁项集挖掘
- maximal frequent patterns itemsets 最大频繁集
- maximal frequent sequential pattern 最大频繁序列模式
- weighted maximal frequent subgraph 最大加权频繁子图
- maximal frequent closed itemsets 最大频繁闭项目集
- Keywords data mining;sequential pattern;frequent subtree;condensed set; 数据挖掘;序列模式;频繁子树;精简集;
- She will be a maximal help to here. 她到这儿将是个极大的帮助。
- She obtained maximal benefit from the course. 她从该课程中获益极大。
- Riots are of frequent occurrence in this province. 这省经常发生骚乱。
- "Waste not, want not" is her favorite maxim. “不浪费则不匮乏”是她特别喜爱的格言。
