Abstract: By studying Apriori algorithm, this paper points out its disadvantages, and proposes the transaction database mapping for an across linker description, which reduces the time cost of the database linking and the scanning time of the transaction record. It gives an improved algorithm. By analyzing the efficiency of the Apriori algorithm and the improved algorithm, it shows that the improved algorithm is better than Apriori algorithm in execution efficiency.

Key words: data mining, association rules, transaction database, Apriori algorithm, across linker

摘要： 针对Apriori算法中存在的不足，提出一种把事务数据库映射到十字链表中的改进算法。该算法可以减少连接数据库的次数及事务记录的扫描次数。Apriori算法与改进算法的性能对比分析表明，改进算法能有效提高执行效率。

关键词: 数据挖掘, 关联规则, 事务数据库, Apriori 算法, 十字链表

CLC Number: 

• TP301.6