An Efficient Algorithm for Updating Association Rules with Incremental Transactions and Minimum Support Changes Simultaneously

摘要

This paper proposes a new algorithm FIM_AIUA, which updates association rules with incremental transactions and minimum support changes simultaneously. The algorithm expands FIM algorithm and AIUA algorithm, improves the efficiency and corrects the mistakes of My_IUA algorithm. Moreover, it modifies FIM algorithm with a new argument and presents a new function fim_aiua_gen() that rewrites the function aiua_gen() of AIUA algorithm. Experiments with real transaction data of a supermarket show that our proposed algorithm FIM_AIUA is efficient and outperforms both My_IUA algorithm and Apriori algorithm.