您要查找的是不是：
- Text Classification Based on Sentence-level Maximal Frequent Sequence 基于句子级的最大频繁序列的文本分类
- maximal frequent sequence 最大频繁序列
- 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 item sequence sets 最大频繁项目序列集
- 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充分利用位图的字节特性，优化了项集的匹配和合并操作，并首次在其中引入了基于局部最大频繁项集的超集存在判断方法。
- Therefore, firstly the paper makes use of GA method to find the frequent time interval between two items in the sequence, then according to the frequent time interval scans the affair sequence database and finally finds out the frequent sequence. 利用了灰关联分析方法找出两个项之间的频繁时间间隔;再利用该间隔扫描事务序列数据库;从而最终找出频繁序列.
- 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 closely linked frequent sequence 紧密连续频繁序列
- Maximal Frequent Path (MFP) method 最大频繁访问路径方法
- maximal frequent item set mining 最大频繁项集挖掘
- maximal frequent patterns itemsets 最大频繁集
- maximal frequent sequential pattern 最大频繁序列模式
- weighted maximal frequent subgraph 最大加权频繁子图
- maximal frequent closed itemsets 最大频繁闭项目集
- In video disk, a consecutive sequence of frames. 在视频光盘上，一种连续的帧序列。
- The core idea of the method was to seek frequently-used sets of services combination sequences from the preexistent ones, then used the frequent sequences to recommend the services. 其核心思想是通过从以往服务组合序列中发现高频率出现的组合序列集，然后利用该序列集进行服务推荐。
- She made a sequence of dance movements. 她做了一个连续的舞蹈动作。
- Improvement of ISS_DM algorithm based on mining of maximal frequent item sequence sets 基于最大频繁项目序列集挖掘ISS_DM算法的改进
- Put the mixed historical facts in sequence. 将混淆的历史事件按顺序排列。
