您要查找的是不是：
- 2) 采用关联规则中的Apriori算法获取优先工序序列段。2) How to discover preferential operation series segment adopting Apriori algorithm in association rules.
- 经典的生成频繁项目集集合的算法包括Apriori算法和FP-growth算法。The famous algorithms to find the frequent itemsets include Apriori and FP-growth.
- 给出了一个Apriori算法的改进算法，能有效提高原Apriori算法的时间效率。Presenting and proving an algorithm to improve the Aprioria I go r it h m.
- 在原有的Apriori算法的基础上提出了在关系数据库中的可拓关联规则挖掘算法。The creation in this paper is that we present an algorithm of association rules,discovery based on extension transformation and Apriori algorithm.
- 算法设计algorithm design
- 算法设计与分析The Design and Analysis of Algorithm
- 第二种是TID算法，此算通过减少对数据库的扫描次数完成了对Apriori算法优化。The second is TID algorithm,which make the Apriori algorithm more efficient by reducing the times of scanning database.
- 控制算法control algorithm
- 聚类算法clustering algorithm
- 启发式算法heuristic algorithm
- 迭代算法iterative algorithm
- 最优控制算法algorithm for optimal control
- 渐缩算法knapsack algorithm
- 调度算法scheduling algorithm
- Ｋ－Ｐ算法K-P calculation
- ＫＫＲ算法KKR calculation
- 逼近算法approximate algorithm
- "分裂和合并" 算法split-and-merge algorithm
- 按序算法sequential algorithm
- 编译算法compiling algorithm
