APRIORI MULTIPLE ALGORITHM FOR MINING ASSOCIATION RULES

Abstract

One of the most important data mining problems is mining association rules. In this paper we consider discovering association rules from large transaction databases. The problem of discovering association rules can be decomposed into two sub-problems: find large itemsets and generate association rules from large itemsets. The second sub-problem is easier one and the complexity of discovering association rules is determined by complexity of discovering large itemsets. In this paper, we suggest Apriori-based algorithm for discovering large itemsets. Actually, we suggest a new procedure for large itemsets generation which is more efficient than the appropriate procedure of the original Apriori algorithm. For its implementation, we suggest a modified sort-merge-join algorithm, which is more efficient than nested-loop-join algorithm, which is suggested in the original Apriori algorithm. Besides, we propose a way in which Apriori Multiple finishes in just two iterations.