1.
Thus,EUFIA can discover newly generated frequent itemsets more efficiently and need rescan the original database only once to get overall frequent itemsets in the final database if necessary.
同时,最多只扫描1次原数据库也能获得更新后事务数据库的全局频繁项集。
2.
Research on All Frequent Itemsets Mining Algorithm and Its Application to the Classification Area
完全频繁项集挖掘算法及其在分类中应用研究
3.
Maximal frequent item set mining with establishment of frequent item set vectors
建立频繁项目集向量的极大频繁项目集挖掘
4.
An Algorithm Mining Frequent Item Set and their Related Transaction Set
频繁项目集及相关事务集的挖掘算法
5.
A frequent itemsets mining algorithm based on set;
一种基于集合的频繁项目集挖掘算法
6.
New algorithm for mining maximum frequent itemsets based on datasets iteration
挖掘最大频繁项集的事务集迭代算法
7.
Fast Mining of Maximum Frequent Item-set Based on Item-set Dismantling
基于项集分解的快速挖掘最大频繁项集算法
8.
Algorithm of mining frequent itemsets based on pending items
基于待与项集的频繁项集挖掘算法的研究
9.
The problem of fuzzy constraint in frequent itemset mining is studied.
研究频繁项集挖掘中的模糊约束问题。
10.
Mining Maximal Frequent Patterns in a Unidirectional FP-tree;
基于单向FP-树的最大频繁项集挖掘
11.
MS-Miner: A New Frequent Itemsets Mining Algorithm;
MS-Miner：一种新的频繁项集挖掘算法
12.
F-Miner: A New Frequent Itemsets Mining Algorithm;
F-Miner：一种新的频繁项集挖掘算法
13.
Algorithm based on adjacent lattice for finding frequent itemsets;
基于邻接网络的频繁项目集发现算法
14.
Study on Associative Classification Based on Closed Frequent Itemsets
基于频繁闭项集的关联分类算法研究
15.
Research on Maximum Frequent Itemsets Based on Improved FP-tree
基于改进FP-树的最大频繁项目集研究
16.
An Algorithm for Mining Maximum Frequent Itemsets Based on T-tree
基于T-tree的最大频繁项目集挖掘算法
17.
An Algorithm for Mining Frequent Itemsets in Data Streams
一种面向数据流的频繁项集挖掘算法
18.
An Improved Maximal Frequent Itemsets Mining Algorithm
一种改进的最大频繁项目集挖掘算法