| 关联规则挖掘AprioriHybrid算法的研究和改进 |
| |
| 引用本文： | 秦吉胜,宋瀚涛.关联规则挖掘AprioriHybrid算法的研究和改进[J].计算机工程,2004,30(17):7-8,135. |
| |
| 作者姓名： | 秦吉胜 宋瀚涛 |
| |
| 作者单位： | 北京理工大学计算机系,北京,100081 |
| |
| 摘 要： | 分析了关联规则挖掘Apriori、AprioriTid和AprioriHybrid算法的优缺点，针对AprioriHybrid算法的瓶颈提出了一种使用支持度矩阵对频繁2项集快速验证的方法，并给出了一种简单易行，而又高效的逐步缩减交易数据库的方法，加快了对候选频繁k项集的验证速度，从而显著地提高AprioriHybrid算法的效率。
|
| 关 键 词： | 关联规则 频繁项集 AprioriHybrid 支持度矩阵 |
| 文章编号： | 1000-3428(2004)17-0007-02 |
Study and Improvement of AprioriHybrid Algorithm in Mining Association Rules |
| |
| QIN Jisheng,SONG Hantao.Study and Improvement of AprioriHybrid Algorithm in Mining Association Rules[J].Computer Engineering,2004,30(17):7-8,135. |
| |
| Authors: | QIN Jisheng SONG Hantao |
| |
| Abstract: | The paper analyzes the advantages and disadvantages of Apriori, AprioriTid and AprioriHybrid algorithm in mining association rules. To solve the bottle of AprioriHybrid algorithm, a support-matrix method to rapidly verify the 2-frequent itemsets is put forward. To accelerate the verification speed of the k-frequent itemsets, a simple and highly efficient method of minimizing the trade database is given. All these two methods improve the efficiency of AprioriHybrid method evidently. |
| |
| Keywords: | Association rules Frequent itemsets AprioriHybrid Support matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
