數據挖掘作業

consider the following set of candidate 3-itemsets: {1,2,3},{1,2,6},{1,3,4},{2,3,4},{2,4,5},{3,4,6},{4,5,6} (a)Construct a hash tree for the above candidate 3-itemsets. Assume the tree uses a hash fun
相關文章
相關標籤/搜索