您要查找的是不是：
- This paper also discusses how to set the optimal minimum support for the common association rules mining algorithm,which can guarantee the frequent items are the weighted frequent items' superset. 同时,给出了最优的最小支持度设定方法,保证了普通关联规则算法所产生的频繁集为加权频繁集的超集。
- weighted frequent items 加权频繁项集
- weighted frequent item sets 加权频繁集
- Thinking about the amount of hits on homepage, this paper improves the algorithm of finding frequent items. 并结合网页特点，考虑到主页的点击率的影响，对生成频繁访问浏览页的算法做了改进；
- Experimental results showed that GGTWFPMiner was an effective weighted frequent patterns mining algorithm based on graph traversals. 实验结果表明，该算法是一个高效的基于图遍历的加权频繁模式挖掘算法。
- Based on this model, a new algorithm called Global Graph Traversals-based Weighted Frequent Patterns Miner (GGTWFPMiner) was presented. 基于该模型，提出了基于全局图遍历加权频繁模式挖掘算法。
- The results show that the algorithm will find a passel of frequent items within a few generations. 实际计算结果表明，该方法一般在几代内即可找到一批长频繁模式。
- The limitlessness and mobility of data streams made the traditional frequent item algorithm difficult to apply to data streams. 摘要数据流的无限性和流动性使得传统的频繁项挖掘算法难以适用。
- The searching space of frequent temporal sequence patterns could be reduced and the efficiency of association rule mining could be improved by projecting frequent items in time windows to prefix projected accumulation trees. 将时间窗口内频繁项的信息映射到前缀映射累加树中，以降低频繁时序模式的搜索空间，提高时序关联规则的挖掘效率。
- Another is that sorting frequent item of not fuzzy attributes in descending order of their support firstly,then sorting database fuzzy attributes with frequent item in ascending order of their nodes number in FFP tree. 先对非模糊属性下的频繁项目按支持度从大到小进行排序,再对模糊属性按其在FFP-树中包含的不同结点的个数,从少到多进行排序,然后依次将各属性下的频繁项目插入到头表中。
- 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充分利用位图的字节特性，优化了项集的匹配和合并操作，并首次在其中引入了基于局部最大频繁项集的超集存在判断方法。
- 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. 为缩减关联规则存储空间和方便查询关联规则,提出一种前件为单一项目的最小预测集算法。
- adverse balance of frequent items 经常项目逆差
- maximal frequent item sequence sets 最大频繁项目序列集
- The chair sagged down under the fat man's weight. 椅子经这胖人一坐便压弯了。
- maximal frequent item set mining 最大频繁项集挖掘
- The selection was weighted against me. 那次选拔对我不利55。
- frequent item maintaining algorithm 频繁项监测算法
- A reliable car is worth its weight in gold. 靠得住的汽车就是无价之宝。
