Apriori algorithm: Difference between revisions

Revision as of 15:41, 20 April 2004

Revision as of 15:44, 20 April 2004

Line 1:

== Description ==

Apriori is an efficient [[association rule mining]] algorithm, deviseddeveloped by Agrawal et al. (Agrawal 93, Agrawal 94)

Apriori (Agrawal, 94) employs BFS and uses a hash tree structure to count candidate item sets efficiently. The algorithm generates candidate item sets (patterns) of length <math>k</math> from <math>k-1</math> length item sets. Then, the patterns which have an infrequent sub pattern are pruned. According to the downward closure lemma, the generated candidate set contains all frequent <math>k</math> length item sets. Following that, the whole transaction database is scanned to determine frequent item sets among the candidates \cite{zaki99parallel}. For determining frequent items in a fast manner, the algorithm uses a hash tree to store candidate itemsets. Note: A hash tree has item sets at the leaves and hash tables at internal nodes (Zaki, 99).

== Algorithm ==

Line 22:

== References ==

Rakesh Agrawal and Tomasz Imielinski and Arun N. Swami, '''Mining Association Rules between Sets of Items in Large Databases''', Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data.

Rakesh Agrawal and Ramakrishnan Srikant, ''Fast Algorithms for Mining Association Rules'', Proc. 20th Int. Conf. Very Large Data Bases (VLDB), 1994.

Line 28:

Heikki Mannila and Hannu Toivonen and A. Inkeri Verkamo, ''Efficient algorithms for discovering association rules'', AAAI Workshop on Knowledge Discovery in Databases (KDD-94), 1994.

Mohammed Javeed Zaki and Srinivasan Parthasarathy and Mitsunori Ogihara and Wei Li, '''Parallel Algorithms for Discovery of Association Rules''', Data Mining and Knowledge Discovery, 1997.