itemsets
基本解释
- 项集
英汉例句
- The problem of fuzzy constraint in frequent itemset mining is studied.
摘要研究频繁项集挖掘中的模糊约束问题。 - The famous algorithms to find the frequent itemsets include Apriori and FP-growth.
经典的生成频繁项目集集合的算法包括Apriori算法和FP-growth算法。 - 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.
发现最大频繁项目集是多种数据开采应用中的关键问题 . - The HCM sketch uses breadth-first search strategy to identify and evaluate the hierarchical frequent itemsets.
基于该结构,利用广度优先查询策略,查找多层频繁项集和估计多层频繁项值。