您要查找的是不是：
- 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. 为缩减关联规则存储空间和方便查询关联规则,提出一种前件为单一项目的最小预测集算法。
- maximal frequent item set mining 最大频繁项集挖掘
- This algorithm can generate new candidate item sets effectively using the frequent item sets in the knowledge database, so it can avoid the problem that candidate item sets is very large. 该算法可以有效利用知识数据库中保留的最小非高频项目集来产生新的候选项目集,避免了候选项目集的数量太庞大的问题。
- 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充分利用位图的字节特性，优化了项集的匹配和合并操作，并首次在其中引入了基于局部最大频繁项集的超集存在判断方法。
- An Algorithm Mining Frequent Item Set and their Related Transaction Set 频繁项目集及相关事务集的挖掘算法
- constrained frequent item sets mining 约束频繁项挖掘
- Study of Maximum Frequent Item Sets based on web log mining 基于web挖掘中最大频繁项目集的研究
- frequent item set 频繁项集
- maximum frequent item set 最大频繁项目集
- frequent item set discovering 频繁项集发现
- frequent item set mining 频繁项集挖掘
- Largest frequent item set 最大频繁项目集
- An Algorithm of Extract Association Rules form Concept Lattice Based on the Biggest Frequent Item Sets 在概念格上基于最大频繁项集关联规则提取算法
- The Personalize item settings dialogue box appears. 一个私人设置的对话框出现了。
- long frequent item sets 长频繁项目集
- Frequent items set 频繁项集
- frequent item sets 频繁项集
- Maximum Frequent Item Sets 最大频繁项目集
- The method generates an item set of low dimensionality and a set of classification rules after dealing with the DSM. 通过对差异-相似矩阵的处理，最终得到维度较低的文本特征集，并同时生成分类规则。
- The limitlessness and mobility of data streams made the traditional frequent item algorithm difficult to apply to data streams. 摘要数据流的无限性和流动性使得传统的频繁项挖掘算法难以适用。
