您要查找的是不是：
- Research on Mining Association Rule Based on Improved Apriori Algorithm 基于改进Apriori算法的关联规则挖掘研究
- Application of Improved Apriori Algorithm on Expansive Training to Cultivation of Student Quality 改进的Apriori算法在大学生素质拓展中的应用
- An Improved Apriori Algorithm Apriori算法的一种变形
- improved apriori algorithm AprioriTid优化算法
- Apriori Algorithm source code integrity, and can be used directly. (译)：Apriori算法源代码的完整性，并可以直接使用。
- Apriori algorithm is the classic algorithm in the mining of associate rule. Apriori算法是关联规则挖掘的经典算法。
- We not only develop the Adapted Step,but also improve the Apriori algorithm. 该算法以经典的Apriori算法为基础,在分析研究已有各种优化算法的基础上,提出了自适应步长和扫描树的概念,并采用修剪的方法对Apriori算法进行了改进。
- It has been proven that FP-growth algorithm is better than Apriori algorithm. 实验和研究证明FP-growth算法优于Apriori算法.
- Then, the algorithms of association rule mining is discussed, covering issues from Apriori algorithm to its improved algorithms. 然后,对关联规则挖掘算法做了深入的研究,分析总结了关联规则中经典的Apriori算法及其改进算法。
- We will give a detailed analysis of Apriori algorithm before we present our modified Aprior algorithm. 在分析Apriori算法的基础上,提出了对Apriori算法的改进办法。
- On the base of analysis of Apriori algorithm and DHP algrithm which is widely applied. 文章对关联规则发现中应用较多的Apriori算法和DHP算法进行了分析,提出了一种新的关联规则发现算法。
- The second is TID algorithm,which make the Apriori algorithm more efficient by reducing the times of scanning database. 第二种是TID算法，此算通过减少对数据库的扫描次数完成了对Apriori算法优化。
- Firstly, features are extracted by using Apriori algorithm, and the dataset is offline. 首先用关联算法进行属性选择，计算的对象为离线数据；
- Compared with Apriori algorithm and FP-growth algorithm, Combination Tree algorithm has better efficiency. 与Apriori算法和FP-growth算法相比，该算法具有更好的效率。
- Apriori algorithm, Apriori association rules to achieve a complete source code can be used directly. (译)：Apriori算法， Apriori的关联规则，以实现一个完整的源代码可以直接使用。
- One is to modify the Apriori algorithm to mine association rules between querying keywords and browsing websites. 二是以某些关键字为探勘的目标，来撷取前置项目组为这些关键字的关联规则。
- The creation in this paper is that we present an algorithm of association rules,discovery based on extension transformation and Apriori algorithm. 在原有的Apriori算法的基础上提出了在关系数据库中的可拓关联规则挖掘算法。
- This paper has completed the following research work to solve the problems of the Apriori algorithm and the FP-growth algorithm. 针对Apriori算法和FP-growth算法存在的问题，本文主要开展并完成了以下研究工作：
- Fpmine-SPF algorithm has a far taster speed in association rules mining than the widely used Apriori algorithm and has wonderful scalability. Fpmine-SPF算法挖掘关联规则的速度远快于较长期以来广泛使用的Apriori算法，并有相当好的可伸缩性。
- To the deficiency of Apriori algorithm, this dissertation brings forward a high-efficient algorithm for mining association rule. 针对Apriori算法的不足，提出了一种新的关联规则的高效挖掘算法。
