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.

 
  • 該算法可以有效利用知識數據庫中保留的最小非高頻項目集來(lái)產(chǎn)生新的候選項目集,避免了候選項目集的數量太龐大的問(wèn)題。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan