The mining of frequent items in transactional database is an important task of data mining.
挖掘事务库中的频繁项集是数据挖掘的重要任务之一。
Many approximation algorithms behave well in frequent items mining, but can not control their memory consumption.
许多近似算法能够有效进行频繁项挖掘,但不能有效控制内存资源消耗。
Due to the irreversibility of random hash mapping, current sketch data structures have to traverse the key address space to find frequent items.
由于随机哈希函数不可逆,目前的概要数据结构不得不遍历关键字地址空间以查找和估计频繁项集。
Applying the hierarchical sketch, an algorithm that finds hierarchical frequent items over data streams dynamically and approximately was implemented.
应用该多层概要数据结构,实现了面向数据流的多层频繁项集的动态近似查找算法。
A frequent items mining algorithm of stream data (SW-COUNT) was proposed, which used data sampling technique to mine frequent items of data flow under sliding Windows.
提出了一种流数据上的频繁项挖掘算法(SW - COUNT)。该算法通过数据采样技术挖掘滑动窗口下的数据流频繁项。
Besides, tree structure is extensively adopted in data mining because it doesn't need to generate the frequent items and test them.
此外,由于树结构在挖掘频繁项目时不需要产生频繁项集及对这些频繁项进行测试而被广泛应用于数据挖掘中。
Therefore a concept named maximum support is introduced, which is used to bind the frequent items mined, and exclude meaningless association rules.
因此提出了最大支持度的概念,用来约束频繁项集的挖掘,排除没有意义的关联规则同时也提高了挖掘的效率。
This algorithm first produces frequent items using previous common association rules mining algorithm, then produces weighted frequent items from the previous frequent items.
该算法首先利用普通的关联规则算法产生频繁集,然后在该频繁集的基础上产生加权频繁集。
Extraordinary items are some unusual or infrequent transactions or events on contrary to frequent items. According to persistence of earnings, they are the weakest items in persistence.
非常项目是相对于经常项目而言的一些非正常或非经常的交易或事项,依照盈利的持续性原理,它是持续性最弱的项目。
This paper also discusses how to set the optimal minimum support for the common association rules mining algorithm, which can guarantee the frequent items are the weighted frequent items' superset.
同时,给出了最优的最小支持度设定方法,保证了普通关联规则算法所产生的频繁集为加权频繁集的超集。
This paper also discusses how to set the optimal minimum support for the common association rules mining algorithm, which can guarantee the frequent items are the weighted frequent items' superset.
同时,给出了最优的最小支持度设定方法,保证了普通关联规则算法所产生的频繁集为加权频繁集的超集。
应用推荐