1.
Mining Accurate Top-K Frequent Itemsets from Data Streams
基于数据流的top-k频繁项集挖掘
2.
Research on top k Frequent Closed Pattern Mining in Data Streams
数据流中top k项频繁闭合模式挖掘研究
3.
Research and Implementation of Top-k Frequent Patterns Mining
基于Top-K项频繁模式挖掘的研究及实现
4.
Research on Algorithms for Mining top-K Frequent Patterns over Data Streams
数据流top-K频繁模式挖掘算法研究
5.
An Efficient Mixed-searching-based Algorithm for Mining Top-K Most-frequent Patterns
一种基于混合搜索的高效Top-K最频繁模式挖掘算法
6.
Maximal frequent item set mining with establishment of frequent item set vectors
建立频繁项目集向量的极大频繁项目集挖掘
7.
Efficient Top-K Query Processing in Central Peer-to-Peer Network
集中式P2P环境下有效的Top-K查询
8.
Multiple Time Granularities Supported Mining Most Frequent K Items in Data Streams
支持多时间粒度的数据流上最频繁K项挖掘
9.
An Algorithm Mining Frequent Item Set and their Related Transaction Set
频繁项目集及相关事务集的挖掘算法
10.
A frequent itemsets mining algorithm based on set;
一种基于集合的频繁项目集挖掘算法
11.
New algorithm for mining maximum frequent itemsets based on datasets iteration
挖掘最大频繁项集的事务集迭代算法
12.
Fast Mining of Maximum Frequent Item-set Based on Item-set Dismantling
基于项集分解的快速挖掘最大频繁项集算法
13.
Algorithm of mining frequent itemsets based on pending items
基于待与项集的频繁项集挖掘算法的研究
14.
The problem of fuzzy constraint in frequent itemset mining is studied.
研究频繁项集挖掘中的模糊约束问题。
15.
Mining Maximal Frequent Patterns in a Unidirectional FP-tree;
基于单向FP-树的最大频繁项集挖掘
16.
MS-Miner: A New Frequent Itemsets Mining Algorithm;
MS-Miner：一种新的频繁项集挖掘算法
17.
F-Miner: A New Frequent Itemsets Mining Algorithm;
F-Miner：一种新的频繁项集挖掘算法
18.
Algorithm based on adjacent lattice for finding frequent itemsets;
基于邻接网络的频繁项目集发现算法