Itemset

常見(jiàn)例句

• The problem of fuzzy constraint in frequent itemset mining is studied.
  摘要研究頻繁項(xiàng)集挖掘中的模糊約束問(wèn)題。
• Setting this value to 0 specifies that there is no limit to the size of the itemset.
  將該值設(shè)置為0將指定對(duì)項(xiàng)集的大小沒(méi)有限制。
• Grahne G,Zhu Jian-fei.Fast algorithms for frequent itemset mining using FP-Trees[J].IEEE Transactions on Knowledge and Data Engineering,2005,10:1347.
  胥桂仙;高旭;于紹娜;關(guān)聯(lián)規(guī)則算法在中文文本挖掘中的應(yīng)用研究[J].;中央民族大學(xué)學(xué)報(bào);2004;13(4):332-338
• For example, if every itemset contains a specific state of an attribute, a rule that predicts state is trivial, even though the probability is very high.
  例如,如果每個(gè)項(xiàng)集都包含屬性的某個(gè)特定狀態(tài),那么,即使概率非常高,預(yù)測(cè)狀態(tài)的規(guī)則也并不重要。
• Setting this value to a whole number greater than 1 specifies the minimum number of cases as the absolute number of cases that must contain the itemset.
  將該值設(shè)置為大于1的整數(shù)將指定最小事例數(shù)作為必須包含項(xiàng)集的事例的絕對(duì)數(shù)。
• Further, based upon the desirable properties of closed itemset lattices, a partition-based algorithm is developed, which proves to be highly efficient without information loss.
  提出了一個(gè)基于劃分的高效算法，在信息無(wú)損的前提下提高算法的效率。
返回 Itemset