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.
  發(fā)現(xiàn)頻繁項目集是關聯(lián)規(guī)則數(shù)據(jù)開采中的關鍵問題。
• Discovering maximum frequent itemsets is a key problem in many data mining applications.
  發(fā)現(xiàn)最大頻繁項目集是多種數(shù)據(jù)開采應用中的關鍵問題 .
• The HCM sketch uses breadth-first search strategy to identify and evaluate the hierarchical frequent itemsets.
  基于該結構,利用廣度優(yōu)先查詢策略,查找多層頻繁項集和估計多層頻繁項值。
• In data mining,IUA algorithm has a problem that the frequent itemsets are not minined completely.
  在關聯(lián)規(guī)則挖掘中,對所挖掘出的關聯(lián)規(guī)則的管理和維護非常重要。
返回 itemsets