frequent item set mining 频繁项集挖掘
Incremental Frequent item sets Mining 式频繁项目集探勘
maximal frequent item set mining 最大频繁项集挖掘
Frequent item mining algorithms need to perform as little data stream scanning as possible while using limited size of memory.
数据流频繁项挖掘算法需要利用有限的内存，以尽量少的次数扫描数据流就能得到频繁项。
To meet more extensive mining demand, this paper presents another immune association rule mining method, which aimes at the largest frequent item set.
针对更一般的挖掘需求，提出一种以最大频繁项目集为目标的免疫挖掘算法。
Based on a new idea of frequent item table which can be directly used in fast frequent mode mining, an effective FP_growth mining algorithm is presented in this paper.
提出了一种可直接用于快速频繁模式挖掘的频繁项目表的概念，并实现了具体的频繁模式增量挖掘方法。
应用推荐