摘要： 分析了关联规则挖掘Apriori、AprioriTid和AprioriHybrid算法的优缺点,针对AprioriHybrid算法的瓶颈提出了一种使用支持度矩阵对频繁2项集快速验证的方法,并给出了一种简单易行,而又高效的逐步缩减交易数据库的方法,加快了对候选频繁k项集的验证速度,从而显著地提高了AprioriHybrid算法的效率。

关键词: 关联规则, 频繁项集, AprioriHybrid, 支持度矩阵

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.

中图分类号: 

• TP311.13