Mine frequent itemsets, association rules or association hyperedges
using the Apriori algorithm. The Apriori algorithm employs level-wise
search for frequent itemsets. The implementation of Apriori used
includes some improvements (e.g., a prefix tree and item sorting).
Usage
apriori(data, parameter = NULL, appearance = NULL, control = NULL)
Calls the C implementation of the Apriori algorithm by Christian
Borgelt for mining frequent itemsets, rules or hyperedges.
References
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules
between sets of items in large databases. In Proceedings of the
ACM SIGMOD International Conference on Management of Data, pages
207-216,
Washington D.C., May 1993.
Christian Borgelt and Rudolf Kruse. Induction of Association Rules:
Apriori Implementation. 15th Conference on Computational
Statistics (COMPSTAT 2002, Berlin, Germany) Physica Verlag,
Heidelberg, Germany 2002
Christian Borgelt. Efficient Implementations of Apriori and
Eclat. Workshop of Frequent Item Set Mining Implementations
(FIMI 2003, Melbourne, FL, USA).