关键词: 数据挖掘, 关联规则, AprioriTid算法, 事务压缩, 项目压缩

Abstract: An enhanced algorithm associating AprioriTid with transaction reduction and item reduction technique was put forward. In the algorithm candidate set generation and the support calculation of each itemset were created after each transaction was compressed and connected, and the key word identifying was adopted in the candidate set, thus the process of pruning and string pattern matching was removed from AprioriTid algorithm. Testing results showed that the algorithm clearly outperformed AprioriTid algorithm.

Key words:  data mining, association rule, AprioriTid algorithm, transaction reduction, item reduction