1.
Maximal frequent item set mining with establishment of frequent item set vectors
建立频繁项目集向量的极大频繁项目集挖掘
2.
Research on Maximum Frequent Itemsets Based on Improved FP-tree
基于改进FP-树的最大频繁项目集研究
3.
An Algorithm for Mining Maximum Frequent Itemsets Based on T-tree
基于T-tree的最大频繁项目集挖掘算法
4.
An Improved Maximal Frequent Itemsets Mining Algorithm
一种改进的最大频繁项目集挖掘算法
5.
A fast algorithm for mining maxmum frequent itemsets;
基于集合运算的最大频繁项目集生成算法
6.
Research and Implementation of an Algorithms for Mining Constrained Maximum Frequent Itemsets;
基于约束的最大频繁项目集挖掘算法与实现
7.
An Integrated Updating Algorithm for Mining Maximal Frequent Itemsets Based on FP-Tree;
基于FP-Tree的最大频繁项目集综合更新算法
8.
Study on Fast Mining Algorithm Constrained Maximum Frequent Itemsets
一种约束最大频繁项目集快速挖掘算法研究
9.
Research of Mining Maximum Frequent Itemsets Based on Dynamic Programming
基于动态规划的最大频繁项目集挖掘研究
10.
Incremental updating algorithm of maximum frequent itemsets based on FP_tree
基于FP_tree的最大频繁项目集增量式更新算法
11.
An Algorithm for Mining Maximum Frequent Item Sets Based on FP-tree
一种基于FP-tree的最大频繁项目集挖掘算法
12.
An Algorithm Mining Frequent Item Set and their Related Transaction Set
频繁项目集及相关事务集的挖掘算法
13.
A frequent itemsets mining algorithm based on set;
一种基于集合的频繁项目集挖掘算法
14.
New algorithm for mining maximum frequent itemsets based on datasets iteration
挖掘最大频繁项集的事务集迭代算法
15.
Algorithm based on adjacent lattice for finding frequent itemsets;
基于邻接网络的频繁项目集发现算法
16.
Discovering maximum frequent itemsets is a key problem in many data mining applications.
发现最大频繁项目集是多种数据开采应用中的关键问题 .
17.
Fast Mining of Maximum Frequent Item-set Based on Item-set Dismantling
基于项集分解的快速挖掘最大频繁项集算法
18.
Mining Maximal Frequent Patterns in a Unidirectional FP-tree;
基于单向FP-树的最大频繁项集挖掘