关键词: 关联规则, Apriori, I_Apriori, 复杂度, 效率

Abstract: There are many algorithms in the field of association rule mining, the most classic one is Apriori algorithm, which is used to find frequent itemsets and discovery association rules between projects, however, the execution efficiency of this algorithm is very low. Aiming at the problems of excessive I/O burden and large amount of calculation in the process of producing frequent itemsets and so on, this paper presents an improved scheme based on Apriori algorithm, named I_Apriori, which improves the efficiency of the algorithm execution by reducing the times of scanning database, reducing the computational complexity of candidate itemsets and reducing the calculation amount of the pre-pruning step and other ways. Contrasting Apriori and I_Apriori, the computational complexity of I_Apriori is lower. By contrast test, the results show that I_Apriori algorithm performs efficiently compared to the Apriori algorithm.

Key words: association rule, Apriori, I_Apriori, complexity, efficiency