The second, clustered the data, and then discovered frequent items sets in the result of clustering.
然后对数据先进行聚类，再在聚类结果中发掘频繁项目集；
Due to the irreversibility of random hash mapping, current sketch data structures have to traverse the key address space to find frequent items.
由于随机哈希函数不可逆，目前的概要数据结构不得不遍历关键字地址空间以查找和估计频繁项集。
The mining of frequent items in transactional database is an important task of data mining.
挖掘事务库中的频繁项集是数据挖掘的重要任务之一。
应用推荐