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.
基於該結搆,利用廣度優先查詢策略,查找多層頻繁項集和估計多層頻繁項值。